Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time
SCG '87 Proceedings of the third annual symposium on Computational geometry
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Efficient minimum spanning tree construction without Delaunay triangulation
Information Processing Letters
Approaching the 5/4-Approximation for Rectilinear Steiner Trees
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
DAC '78 Proceedings of the 15th Design Automation Conference
The Lee Path Connection Algorithm
IEEE Transactions on Computers
Efficient obstacle-avoiding rectilinear steiner tree construction
Proceedings of the 2007 international symposium on Physical design
Maze routing steiner trees with effective critical sink optimization
Proceedings of the 2007 international symposium on Physical design
Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
High-performance routing at the nanometer scale
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction
Proceedings of the 2008 international symposium on Physical design
A full-scale solution to the rectilinear obstacle-avoiding Steiner problem
Integration, the VLSI Journal
An efficient rectilinear Steiner tree algorithm with obstacles
CSECS'06 Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing
Efficient rectilinear Steiner tree construction with rectangular obstacles
CSECS'06 Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing
A multi-layer obstacles-avoiding router using X-architecture
WSEAS Transactions on Circuits and Systems
Obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
On improving optimization effectiveness in interconnect-driven physical synthesis
Proceedings of the 2009 international symposium on Physical design
Proceedings of the 2009 international symposium on Physical design
High-performance obstacle-avoiding rectilinear steiner tree construction
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Multi-layer rectangular/non-rectangular bstacles-avoiding X-architecture router
ICC'08 Proceedings of the 12th WSEAS international conference on Circuits
Timing-driven non-rectangular obstacles-avoiding routing algorithm for the X-architecture
IMCAS'09 Proceedings of the 8th WSEAS international conference on Instrumentation, measurement, circuits and systems
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction
Proceedings of the 46th Annual Design Automation Conference
WSEAS Transactions on Circuits and Systems
Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree
Proceedings of the 2009 International Conference on Computer-Aided Design
Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection
Proceedings of the 2009 International Conference on Computer-Aided Design
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Proceedings of the 19th international symposium on Physical design
An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles
Proceedings of the 48th Design Automation Conference
Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach
Proceedings of the International Conference on Computer-Aided Design
Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach
Integration, the VLSI Journal
| Hi-index | 0.00 |
Given n points on a plane, a Rectilinear Steiner Minimal Tree (RSMT) connects these points through some extra points called steiner points to achieve a tree with minimal total wire length. Taking blockages into account dramatically increases the problem complexity. It is extremely unlikely that an efficient optimal algorithm exists for Rectilinear Steiner Minimal Tree Construction with Rectilinear Blockages (RSMTRB). Although there exist some heuristic algorithms for this problem, they have either poor quality or expensive running time. In this paper, we propose an efficient and effective approach to solve RSMTRB. The connection graph we used in this approach is called spanning graph which only contains O(n) edges and vertices. An O(n log n) time algorithm is proposed to construct spanning graph for RSMTRB. The experimental results show that this approach can achieve a solution with significantly reduced wire length. The total run time increased is negligible in the whole design flow.