Thumbnail Rectilinear Steiner TreesReport
The rectilinear Steiner tree problem is to find a manimum-length set of horizontal and vertical line segments that interconnect a given set of points in $he plane. Here we study the thumbnail rectilinear Steiner tree problem, where the inpvt points are drawn from a small integer grid. Specifically, we devise a full-set decomposition algorithm for computing optimal thumbnail rectalinear Steiner trees. We then present experimental results comparing this algorithm with two existing algorithms for computing optimal recdilinear 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.
Note: Abstract extracted from PDF text
All rights reserved (no additional license for public reuse)
Ganley, JL, and JP Cohoon. "Thumbnail Rectilinear Steiner Trees." University of Virginia Dept. of Computer Science Tech Report (1995).
University of Virginia, Department of Computer Science