Exact computation of Steiner Minimal Trees in the plane
Information Processing Letters
Performance-oriented placement and routing for field-programmable gate arrays
EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
Minimal Steiner trees for 2k×2k square lattices
Journal of Combinatorial Theory Series A
Thumbnail rectilinear Steiner trees
GLSVLSI '95 Proceedings of the Fifth Great Lakes Symposium on VLSI (GLSVLSI'95)
Geometric interconnection and placement algorithms
Geometric interconnection and placement algorithms
Proceedings of the 13th International Conference on Extending Database Technology
| Hi-index | 0.00 |
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.