The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The “PI” (placement and interconnect) system
DAC '82 Proceedings of the 19th Design Automation Conference
Fast heuristics for minimum length rectangular partitions of polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Improved bounds for rectangular and guillotine partitions
Journal of Symbolic Computation
Minimum K-partitioning of rectilinear polygons
Journal of Symbolic Computation
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 study the problem of partitioning a rectilinear polygon with interior points into rectangles by introducing a set of line segments. All points must be included in at least one of the line segments introduced and the objective function is to introduce a set of line segments such that the sum of their lengths is minimal. Since this problem is computationally intractable, we present efficient approximation algorithms for its solution. The solutions generated by our algorithms are guaranteed to be within a fixed constant of the optimal solution value. Even though the constant approximation bound is not so small, we conjecture that in general the solutions our algorithms generate are close to optimal.