Obstacle-avoiding rectilinear Steiner tree construction based on Steiner point selection

Authors:
Chih-Hung Liu;Shih-Yi Yuan;Sy-Yen Kuo;Jung-Hung Weng
Affiliations:
Graduate Institute of Electronics Engineering and National Taiwan University;Feng Chia University;Graduate Institute of Electronics Engineering and National Taiwan University;Graduate Institute of Electronics Engineering and National Taiwan University
Venue:
Proceedings of the 2009 International Conference on Computer-Aided Design
Year:
2009

Citing 13
Cited 2

Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles

IEEE Transactions on Computers
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
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
Circuit simulation based obstacle-aware Steiner routing

Proceedings of the 43rd annual Design Automation Conference
FastRoute: a step to integrate global routing into placement

Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction

ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree

Proceedings of the 2008 international symposium on Physical design
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction

Proceedings of the 46th Annual Design Automation Conference
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
Obstacle-avoiding rectilinear Steiner tree construction in sequential and parallel approach

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem, this paper presents a Steiner-point based algorithm to achieve the best practical performance in wirelength and run time. Unlike many previous works, the Steiner-based framework is more focused on the usage of Steiner points instead of the handling of obstacles. This paper also proposes a new concept of Steiner point locations to provide an effective as well as efficient way to generate desirable Steiner point candidates. Experimental results show that this algorithm achieves the best solution quality in Θ (n log n) empirical time, which was originally generated by applying the maze routing on an Ω(n2)-space graph. The Steiner-point based framework and the new concept of Steiner point locations can be applied to future research on the OARSMT problem and its generations, such as the multi-layer OARSMT problem.