Abstract
It was conjectured by Gilbert and Pollak [6] that, for any finite set of points in the Euclidean plane, the ratio of the length of a Steiner minimal tree to the length of a minimal spanning tree is at least\(\sqrt 3 /2\). To date, this has been proved only for at most five points. In this paper, some analytic formulas for the length of full Steiner trees are considered. These provide an alternative proof of the conjecture for quadrilaterals, and the foundation for a possible approach for more complicated polygons.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
F. R. K. Chung and R. L. Graham, A new bound for Euclidean Steiner minimal tress,Ann. N.Y. Acad. Sci. 440 (1985), 328–346.
D. Z. Du and F. K. Hwang, A new bound for the Steiner ratio,Trans. Amer. Math. Soc. 278, No. 1 (1983), 137–148.
D. Z. Du, F. K. Hwang, and J. F. Weng, Steiner minimal trees on zigzag lines,Trans. Amer. Math. Soc. 278, No. 1 (1983), 149–156.
D. Z. Du, E. Y. Yao, and F. K. Hwang, A short proof of a result of Pollak on Steiner minimal trees,J. Combin. Theory Ser. A 32 (1982), 396–400.
D. Z. Du, E. Yao, and F. K. Hwang, The Steiner ratio conjecture is true for five points,J. Combin. Theory Ser. A 38 (1985), 230–240.
E. N. Gilbert and H. O. Pollak, Steiner minimal trees,SIAM J. Appl. Math. 16 (1968), 1–29.
Z. A. Melzak, On the problem of Steiner,Canad. Math. Bull. 4 (1961), 143–148.
K. Ollerenshaw, Minimum networks linking four points in a plane,Bull. Inst. Math. Appl. 15, Nos. 8–9 (1979), 208–211.
H. O. Pollak, Some remarks on the Steiner problem,J. Combin. Theory Ser. A 24 (1978), 278–295.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Booth, R.S. Analytic formulas for full steiner trees. Discrete Comput Geom 6, 69–82 (1991). https://doi.org/10.1007/BF02574675
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574675