Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CCCG
2008

favoriteEmaildiscussreport

138views Computational Geometry» more CCCG 2008»

The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees

13 years 6 months ago

The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees

Download cccg.ca

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.

Mina Razaghpour, Anna Lubiw

Real-time Traffic

CCCG 2008 | Computational Geometry | Rectilinear Obstacles | Shortest Rectilinear Steiner | Steiner Ratio |

claim paper

Related Content

» A Fast and Stable Algorithm for ObstacleAvoiding Rectilinear Steiner Minimal Tree Construc...

» ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Multilayer ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Minimum moment Steiner trees

» CDCTree novel obstacleavoiding routing tree construction based on current driven circuit m...

» Probabilistic Analysis of Rectilinear Steiner Trees

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» Integrality ratio for group Steiner trees and directed steiner trees

» Rectilinear Steiner Trees with Minimum Elmore Delay

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	CCCG
Authors	Mina Razaghpour, Anna Lubiw

Comments (0)