Minimal Networks on the Regular n-Dimensional Simplex

被引：0
作者：
G. A. Karpunin
机构：
[1] M. V. Lomonosov Moscow State University,
来源：
Mathematical Notes | 2001年 / 69卷
关键词：
minimal networks; Steiner problem; parametric networks; regular simplex; simple trees;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The paper gives the proof of the following fact: all simple, i.e., having no nodes of degree 2, trees that span the vertices of the regular n-dimensional simplex can be realized as nondegenerate minimal parametric networks.
引用
收藏
页码：780 / 789
页数：9
相关论文
共 9 条
  • [1] Karpunin G. A.(2000)An analog of Morse theory for plane linear networks and the generalized Steiner problem Mat. Sb. 191 64-90
  • [2] Ivanov A. O.(1992)Geometry of minimal networks and one-dimensional Plateau problem Uspekhi Mat. Nauk 47 53-115
  • [3] Tuzhilin A. A.(1968)Steiner minimal trees SIAM J. Appl. Math. 16 1-29
  • [4] Gilbert E. N.(1992)How to find Steiner minimal trees in Euclidean d-space Algorithmica 7 137-177
  • [5] Pollak H. O.(1997)Geometry of the set of minimal networks of given topology with fixed boundary Izv. Ross. Akad. Nauk Ser. Mat. 61 119-152
  • [6] Smith W. D.(1901)Ueber die kleinste Kugel, die eine räumliche Figur einschliesst J. Reine Angew. Math. 123 241-257
  • [7] Ivanov A. O.(undefined)undefined undefined undefined undefined-undefined
  • [8] Tuzhilin A. A.(undefined)undefined undefined undefined undefined-undefined
  • [9] Jung H. W. E.(undefined)undefined undefined undefined undefined-undefined
1