Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Bounds for partitioning rectilinear polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Bounds on the Length of Convex Partitions of Polygons
Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science
Heuristics for minimum edge length rectangular partitions of rectilinear figures
Proceedings of the 6th GI-Conference on Theoretical Computer Science
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
Improved bounds for rectangular and guillotine partitions
Journal of Symbolic Computation
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
A fast approximation algorithm for TSP with neighborhoods
Nordic Journal of Computing
On the number of rectangular partitions
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory Series A
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |
We consider the problem of partitioning isothetic polygons into rectangles by drawing edges of minimum total length. The problem has various applications [LPRS], eg. in VLSI design when dividing routing regions into channels ([Riv1], [Riv2]). If the polygons contain holes, the problem in NP-hard [LPRS]. In this paper it is shown how solutions within a constant factor of the optimum can be computed in time &Ogr;(n log n), thus improving the previous &Ogr;(n2) time bound. An unusual divide-and-conquer technique is employed, involving alternating search from two opposite directions, and further efficiency is gained by using a fast method to sort subsets of points. Generalized Voronoi diagrams are used in combination with plane-sweeping in order to detect all “well bounded” rectangles, which are essential for the heuristic.