Covering rectilinear polygons with axis-parallel rectangles
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 445-454
- https://doi.org/10.1145/301250.301369
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NPPublished by Association for Computing Machinery (ACM) ,1997
- Covering Polygons Is HardJournal of Algorithms, 1994
- On the hardness of approximating minimization problemsPublished by Association for Computing Machinery (ACM) ,1993
- Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with RectanglesSIAM Journal on Discrete Mathematics, 1989
- A new method of image compression using irreducible covers of maximal rectanglesIEEE Transactions on Software Engineering, 1988
- Minimally covering a horizontally convex orthogonal polygonPublished by Association for Computing Machinery (ACM) ,1986
- An algorithm for covering polygons with rectanglesInformation and Control, 1984
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975