Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Improved bounds for rectangular and guillotine partitions
Journal of Symbolic Computation
Minimum partitioning simple rectilinear polygons in O(n log log n) - time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
An optimal algorithm for floorplan area optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Floor-planning by graph dualization: 2-concave rectilinear modules
SIAM Journal on Computing
On optimal guillotine partitions approximating optimal d-box partitions
Computational Geometry: Theory and Applications
Computational geometry in C
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
Heuristics for minimum edge length rectangular partitions of rectilinear figures
Proceedings of the 6th GI-Conference on Theoretical Computer Science
DAC '84 Proceedings of the 21st Design Automation Conference
An efficient algorithm for partitioning parameterized polygons into rectangles
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Partitioning parameterized 45-degree polygons with constraint programming
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
We present two practical algorithms for partitioning circuit components represented by rectilinear polygons so that they can be stored using the L-shaped corner stitching data structure; that is, our algorithms decompose a simple polygon into a set of nonoverlapping L-shapes and rectangles by using horizontal cuts only. The more general of our algorithms computes and optimal configuration for a wide variety of optimization functions, whereas the other computes a minimum configuration of rectangles and L-shapes. Both algorithms run in O(n + h log h time, where n is the number of vertices in the polygon and h is the number of H-pairs. Because for VLSI data h is small, in practice these algorithms are linear in n. Experimental results on actual VLSI data compare our algorithms and demonstrate the gains in performance for corner stitching (as measured by different objective functions) obtained by using them instead of more traditional rectangular partitioning algorithms.