Affiliation:
1. Cadence Design Systems, San Jose, CA
2. Univ. of Virginia, Charlottesville
Abstract
The rectilinear Steiner tree problem is to find a minimum-length set of horizontal and vertical line segments that interconnect a given set of points in the plane. Here we study the
thumbnail rectilinear Steiner tree
problem, where the input points are drawn from a small integer grid. Specifically, we devise a fully-set decomposition algorithm for computing optimal thumbnail rectilinear Steiner trees. We then present experimental results comparing the performance of this algorithm with two existing algorithms for computing optimal rectilinear Steiner trees. The thumbnail rectilinear Steiner tree problem has applications in VLSI placement algorithms, based on geometric partitioning, global routing of field-programmable gate arrays, and routing estimation during floorplanning.
Publisher
Association for Computing Machinery (ACM)
Subject
Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications
Reference25 articles.
1. Rectilinear Steiner trees: Efficient special-case algorithms;AHO A. V.;Networks,1977
2. A Parallel VLSI Circuit Layout Methodology
3. BRAZIL M. COLE T. RUBINSTEIN J. H. THOMAS D. A. WENG J. F. AND WORMALD N. C. 1995. Minimal Steiner trees for 2k ~ 2k square lattices. J. Comb. Theor. Series A 72. 10.1006/jcta.1996.0004 BRAZIL M. COLE T. RUBINSTEIN J. H. THOMAS D. A. WENG J. F. AND WORMALD N. C. 1995. Minimal Steiner trees for 2k ~ 2k square lattices. J. Comb. Theor. Series A 72. 10.1006/jcta.1996.0004
4. Steiner trees on a checkerboard;CHUNG F. R.;Math. Mag.,1989
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献