A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees
2011
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
This paper presents an efficient method to solve the obstacle-avoiding rectilinear Steiner tree (OARSMT) problem optimally. Our work is developed based on the GeoSteiner approach in which full Steiner trees (FSTs) are first constructed and then combined into a rectilinear Steiner minimum tree (RSMT). We modify and extend the algorithm to allow obstacles in the routing region. For each routing obstacle, we first introduce four virtual terminals located at its four corners. We then give the
doi:10.1109/tcad.2010.2098930
fatcat:k5txlttwhbfuxeemlx5lw6gmoq