Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles

This publication has 16 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
  SIAM Journal on Discrete Mathematics, 1990
• An algorithm for covering polygons with rectangles
  Information and Control, 1984
• A minimax theorem on intervals
  Journal of Combinatorial Theory, Series B, 1984
• Covering polygons with minimum number of rectangles
  Published by Springer Nature ,1984
• Algorithms for covering polygons by rectangles
  Computer-Aided Design, 1982
• The power of non-rectilinear holes
  Published by Springer Nature ,1982
• Covering Regions by Rectangles
  SIAM Journal on Algebraic Discrete Methods, 1981
• Decomposing a polygon into its convex parts
  Published by Association for Computing Machinery (ACM) ,1979
• Graph Theory with Applications
  Published by Springer Nature ,1976