Minimal trees for regular polygons: Linear parquets realization
The Steiner problem, which is a modification of the transport problem, has been lately attracting increased attention. Different variants of this problem are formulated in very general terms for trees in an arbitrary Riemannian manifold. In this paper, we shall study a particular case of this problem in a Euclidean plane. General definitions and results, as well as particular cases for other Riemannian manifolds (for example, closed two-dimensional surfaces) are given in the review by the first and the third author [Russ. Math. Surv. 47, No. 2, 59-131 (1992; Zbl 0792.90083); translation from Usp. Mat. Nauk 47, No. 2(284), 53-115 (1992)].
This page was built for publication: Minimal trees for regular polygons: Linear parquets realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908441)