Annals of Operations Research

, Volume 33, Issue 7, pp 549–556

A simple proof of Hwang's theorem for rectilinear Steiner minimal trees

  • D. S. Richards
  • J. S. Salowe
Section VII Computational Geometry And TND

DOI: 10.1007/BF02067241

Cite this article as:
Richards, D.S. & Salowe, J.S. Ann Oper Res (1991) 33: 549. doi:10.1007/BF02067241

Abstract

We present a simple, direct proof of Hwang's characterization of rectilinear Steiner minimal trees [3]: LetS be a set of at least five terminals in the plane. If no rectilinear Steiner minimal tree forS has a terminal of degree two or more, there is a tree in which at most one of the Steiner points does not lie on a straight linel, and the tree edges incident to the Steiner points onl appear on alternate sides. This theorem has been found useful in proving other results for rectilinear Steiner minimal trees.

Copyright information

© J.C. Baltzer AG, Scientific Publishing Company 1991

Authors and Affiliations

  • D. S. Richards
    • 1
  • J. S. Salowe
    • 1
  1. 1.Department of Computer ScienceUniversity of VirginiaCharlottesvilleUSA

Personalised recommendations