Journal of Combinatorial Optimization

, Volume 4, Issue 2, pp 271–284 | Cite as

A 75° Angle Constraint for Plane Minimal T1 Trees

Article
  • 28 Downloads

Abstract

In this paper it is shown that the minimum angle between any 2 edges of an Euclidean plane minimal T1 tree, or 3-size Steiner tree, is at least 75°.

Steiner minimal tree T1 tree Q-component 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.Z. Du, Y.J. Zhang, and Q. Feng, “On better heuristic for Eulidean Steiner minimum trees,” in Proc. of the 32nd Ann. Symp. on Foundations of Computer Science, 1991, pp. 431–439.Google Scholar
  2. D.Z. Du and F.K. Hwang, “A proof of Gilbert and Pollak's conjecture on the Steiner ratio,” Algorithmica, vol. 7, pp. 121–135, 1992.Google Scholar
  3. Z.A. Melzak, “On the problem of Steiner,” Canad. Math. Bull., vol. 4, pp. 143–148, 1961.Google Scholar
  4. J.H. Rubinstein and D.A. Thomas, “The calculus of variations and the Steiner problem,” Ann. Oper. Res., vol. 33, pp. 481–499, 1991.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • T. Cole
    • 1
  1. 1.Department of Electronic and Electrical EngineeringTokyo Institute of Technology, Meguro-KuTokyoJapan

Personalised recommendations