Skip to main content
SpringerLink
Log in

A 75° Angle Constraint for Plane Minimal T1 Trees

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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°.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • 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.

  • 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 

  • Z.A. Melzak, “On the problem of Steiner,” Canad. Math. Bull., vol. 4, pp. 143–148, 1961.

    Google Scholar 

  • 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 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic and Electrical Engineering, Tokyo Institute of Technology, Meguro-Ku, Tokyo, 152, Japan

    T. Cole

Authors
  1. T. Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cole, T. A 75° Angle Constraint for Plane Minimal T1 Trees. Journal of Combinatorial Optimization 4, 271–284 (2000). https://doi.org/10.1023/A:1009807006441

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009807006441

Search

Navigation