Abstract
Locally minimal binary trees that span the vertices of regular polygons are studied. Their description is given in the dual language, that of diagonal triangulations of polygons. Diagonal triangulations of a special form, called skeletons, are considered. It is shown that planar binary trees dual to skeletons with five endpoints do not occur among locally minimal binary trees that span the vertices of regular polygons.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. O. Ivanov and A. A. Tuzhilin, “The Steiner problem for convex boundaries. II. The regular case”,Adv. Soviet Math.,15, 93–131 (1993).
A. A. Tuzhilin, “Minimal binary trees with a regular boundary: the case of skeletons with four ends”,Mat. Sb. [Russian Acad. Sci. Sb. Math.],187, No. 4, 117–159 (1996).
F. K. Hwang, D. Richards, and P. Winter,The Steiner Tree Problem, Elsevier Science Publ., Amsterdam (to appear).
V. Jarnik and M. Kössler, “O minimalnich grafech obeahujicich n danijch bodu,”Cas. Pest. Mat. Fys.,63, 223–235 (1934).
Z. A. Melzak, “On the problem of Steiner,”Canad. Math. Bull.,4, 143–148 (1960).
M. R. Garey, R. L. Graham, and D. S. Johnson, “Some NP-complete geometric problems,” in:8th Annual ACM Symposium on the Theory of Computation, Assoc. Comput. Mach., New York (1976), pp. 10–22.
F. Preparata and M. Shamos,Computational Geometry. An Introduction, Springer-Verlag, New York (1985).
A. O. Ivanov and A. A. Tuzhilin, “Solution of the Steiner problem for convex boundaries,”Uspekhi Mat. Nauk [Russian Math. Surveys],45, No. 2, 207–208 (1990).
A. O. Ivanov and A. A. Tuzhilin, “The Steiner problem for convex boundaries or planar minimal networks,”Mat. Sb. [Math. USSR-Sb.],182, No. 12, 1813–1844 (1991).
A. O. Ivanov and A. A. Tuzhilin, “Geometry of minimal networks and the one-dimensional Plateau problem,”Uspekhi Mat. Nauk [Russian Math. Surveys],47, No. 2 (284), 53–115 (1992).
A. O. Ivanov and A. A. Tuzhilin, “The Steiner problem for convex boundaries. I. General case,”Adv. Soviet Math.,15, 15–92 (1993).
A. O. Ivanov and A. A. Tuzhilin,Minimal Networks. The Steiner Problem and Its Generalizations, CRC Press, Boca Raton, Florida (1994).
A. O. Ivanov and A. A. Tuzhilin, “Topology of locally minimal planar binary trees,”Uspekhi Mat. Nauk [Russian Math. Surveys],49, No. 6, 191–192 (1984).
A. O. Ivanov and A. A. Tuzhilin, “Weighted minimal 2-trees,”Uspekhi Mat. Nauk [Russian Math. Surveys],50, No. 3, 155–156 (1995).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 907–921, June, 1997.
Translated by V. N. Dubrovsky
Rights and permissions
About this article
Cite this article
Tuzhilin, A.A. Minimal binary trees with a regular boundary: The case of skeletons with five endpoints. Math Notes 61, 758–769 (1997). https://doi.org/10.1007/BF02361218
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02361218