Minimal trees for regular polygons: Linear parquets realization (Q1908441)

From MaRDI portal





scientific article; zbMATH DE number 848933
Language Label Description Also known as
default for all languages
No label defined
    English
    Minimal trees for regular polygons: Linear parquets realization
    scientific article; zbMATH DE number 848933

      Statements

      Minimal trees for regular polygons: Linear parquets realization (English)
      0 references
      0 references
      0 references
      0 references
      27 March 1996
      0 references
      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)].
      0 references
      Steiner problem
      0 references
      trees
      0 references
      Riemannian manifold
      0 references
      Euclidean plane
      0 references

      Identifiers