๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Steiner Minimal Trees with One Polygonal Obstacle

โœ Scribed by J. F. Weng and J. MacGregor Smith

Book ID
120137072
Publisher
Springer
Year
2001
Tongue
English
Weight
143 KB
Volume
29
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Steiner minimal trees on regular polygon
Steiner minimal trees on regular polygons with centre
โœ J.F. Weng; R.S. Booth ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

Let P,,n~>3, be the set of vertices of a regular n-gon and o be the centre of P,. Let P+ = P, u [o}. In this paper we determine the Steiner minimal trees on P+. By this example we will see how complicated the Steiner problem may become if even one regular point not lying on the Steiner polygon is ad