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

A decomposition theorem on Euclidean Steiner minimal trees

โœ Scribed by F. K. Hwang; G. D. Song; G. Y. Ting; D. Z. Du

Publisher
Springer
Year
1988
Tongue
English
Weight
623 KB
Volume
3
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Full Minimal Steiner Trees on Lattice Se
Full Minimal Steiner Trees on Lattice Sets
โœ M. Brazil; J.H. Rubinstein; D.A. Thomas; J.F. Weng; N.C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it oft

A class of full Steiner minimal trees
A class of full Steiner minimal trees
โœ F.K. Hwang; Jia Feng Weng; Ding Zhu Du ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

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