Introduction to VLSI Systems
Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons
SCG '87 Proceedings of the third annual symposium on Computational geometry
Minimum K-partitioning of rectilinear polygons
Journal of Symbolic Computation
A New Method of image Compression Using Irreducible Covers of Maximal Rectangles
IEEE Transactions on Software Engineering
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
Efficient fracturing of all angle shaped VLSI mask pattern data
Integration, the VLSI Journal
Linear-time 3-approximation algorithm for the r-star covering problem
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
| Hi-index | 0.00 |
We provide an algorithm which solves the following problem: given a polygon with edges parallel to the x and y axes, which is convex in the y direction, find a minimum size collection of rectangles, which cover the polygon and are contained within it. The algorithm is quadratic in the number of vertices of the polygon. Our method also yields a new proof of a recent duality theorem equating minimum size rectangle covers to maximum size sets of independent points in the polygon.