Spanning trees in hypergraphs with applications to steiner trees
Spanning trees in hypergraphs with applications to steiner trees
Efficient Rectilinear Steiner Tree Construction with Rectilinear Blockages
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane
Proceedings of the 2006 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
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction
Proceedings of the 46th Annual Design Automation Conference
Generation of optimal obstacle-avoiding rectilinear Steiner minimum tree
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
Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach
Proceedings of the International Conference on Computer-Aided Design
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction
Proceedings of the 49th Annual Design Automation Conference
Proceedings of the International Conference on Computer-Aided Design
Construction of rectilinear Steiner minimum trees with slew constraints over obstacles
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the 2014 on International symposium on physical design
Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach
Integration, the VLSI Journal
| Hi-index | 0.00 |
In this paper, we present an exact algorithm for the construction of obstacle-avoiding rectilinear Steiner minimum trees (OARSMTs) among complex rectilinear obstacles. This is the first work to propose a geometric approach to optimally solve the OARSMT problem among complex obstacles. The optimal solution is constructed by the concatenation of full Steiner trees (FSTs) among complex obstacles, which are proven to be of simple structures in this paper. The algorithm is able to handle complex obstacles including both convex and concave ones. Benchmarks with hundreds of terminals among a large number of obstacles are solved optimally in a reasonable amount of time.