solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看7403次
A convex approach to the Gilbert-Steiner problem. (arXiv:1810.05417v1 [math.OC])
来源于:arXiv
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. 查看全文>>