The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees

We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We extend the Steiner ratio to the obstacle-avoiding case and show that it is equal to the Steiner ratio for the obstacle-free case.

• Type: Conference
• Year: 2008
• Where: CCCG
• Authors: Mina Razaghpour, Anna Lubiw
• Keywords: CCCG 2008, Computational Geometry, Rectilinear Obstacles, Shortest Rectilinear Steiner, Steiner Ratio