A class of full Steiner minimal trees

A Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using lines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

[1]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[2]  Ronald L. Graham,et al.  Steiner Trees for Ladders , 1978 .

[3]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[4]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.