Rectilinear Steiner trees on a checkerboard
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
This Paper Appears in : VLSI,1995. Proceedings., Fifth Great Lakes Symposium on on Pages: 46 - 49 This Conference was Held : 16-18 March1995 1995 ISBN: 0-8186-7035-5 IEEE Catalog Number: 95TH8042 Total Pages: xv+274 References Cited: 19 Accession Number: 5137489 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 full-set decomposition algorithm for computing optimal thumbnail rectilinear Steiner trees. We then present experimental results comparing 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 and in global routing of field-programmable gate arrays.