Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm

For the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem, we present a Steiner-point-based algorithm that achieves the best practical performance among existing heuristics. We first propose a new concept of Steiner point locations, creating a linear-space routing graph with satisfactory Steiner point candidates to resolve the bottleneck of most existing heuristics. Then, we propose a Steiner-point-based framework to yield a solution, which is close to the key to the handling of the OARSMT problem. Experimental results show that this algorithm achieves excellent solution quality and speed performance at the same time. We also extend the Steiner-point-based framework to the obstacle-avoiding preferred direction Steiner tree problem with a good performance.

[1]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[2]  Chak-Kuen Wong,et al.  Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles , 1987, IEEE Transactions on Computers.

[3]  Ieee Circuits,et al.  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Hai Zhou,et al.  Efficient minimum spanning tree construction without Delaunay triangulation , 2001, ASP-DAC '01.

[5]  Tao Huang,et al.  Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[6]  Joseph S. B. Mitchell,et al.  L1 shortest paths among polygonal obstacles in the plane , 1992, Algorithmica.

[7]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[8]  Chih-Hung Liu,et al.  Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree , 2008, ISPD '08.

[9]  Chris C. N. Chu,et al.  Efficient rectilinear Steiner tree construction with rectilinear blockages , 2005, 2005 International Conference on Computer Design.

[10]  Hai Zhou,et al.  EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[11]  Joseph L. Ganley,et al.  Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[12]  Chris C. N. Chu,et al.  FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction , 2011, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[14]  D. T. Lee,et al.  A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains , 1998, Algorithmica.

[15]  Chih-Hung Liu,et al.  Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[16]  Frank K. Hwang,et al.  An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.

[17]  Tao Huang,et al.  An exact algorithm for the construction of rectilinear steiner minimum trees among complex obstacles , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[18]  Chak-Kuen Wong,et al.  A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.

[19]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[20]  Evangeline F. Y. Young,et al.  Obstacle-avoiding rectilinear Steiner tree construction , 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

[21]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[22]  Yao-Wen Chang,et al.  Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction , 2007, ICCAD 2007.

[23]  Evangeline F. Y. Young,et al.  Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[24]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[25]  Yao-Wen Chang,et al.  Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[26]  Chih-Hung Liu,et al.  An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction , 2009, 2009 46th ACM/IEEE Design Automation Conference.