An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction

We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARS...

Full description

Saved in:
Bibliographic Details
Published inDAC Design Automation Conference 2012 pp. 613 - 622
Main Authors Liu, Chih-Hung, Chen, I-Che, Lee, D. T.
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 03.06.2012
IEEE
SeriesACM Conferences
Subjects
Algorithm design and analysis
Approximation algorithms
Hardware > Electronic design automation > Physical design (EDA)
Integrated circuits
Joining processes
Obstacle-Avoidance
Physical Design
Rectilinear Steiner Minimal Tree (RSMT)
Routing
Steiner trees
Transforms
rectilinear steiner minimal tree (RSMT)
routing
physical design
obstacle-avoidance
Online AccessGet full text

Cover

More Information
Summary:We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARSMT heuristics. Experimental results show that our algorithm provides a solution with excellent quality and has a significant speed-up compared to previously known results.
ISBN:1450311997
9781450311991
ISSN:0738-100X
DOI:10.1145/2228360.2228471