An algorithm for covering polygons with rectangles
Open Access
- 31 December 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 63 (3) , 164-189
- https://doi.org/10.1016/s0019-9958(84)80012-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- A minimax theorem on intervalsJournal of Combinatorial Theory, Series B, 1984
- Some NP-hard polygon decomposition problemsIEEE Transactions on Information Theory, 1983
- A Class of Perfect Graphs Associated with Planar Rectilinear RegionsSIAM Journal on Algebraic Discrete Methods, 1982
- Algorithms for covering polygons by rectanglesComputer-Aided Design, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981
- Combinatorial properties of polyominoesCombinatorica, 1981
- Covering Regions with SquaresSIAM Journal on Algebraic Discrete Methods, 1981
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979