Inserted: 12 oct 2018
Last Updated: 12 oct 2018
We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in 9, and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting problem is then tackled numerically and we present results for an extensive set of examples. In particular we are able to address the Steiner tree problem on surfaces.
Keywords: convex relaxation, Gilbert-Steiner problem, Steiner tree problem on surfaces