An algorithm for covering polygons with rectangles

DOI10.1016/S0019-9958(84)80012-1zbMath0591.68073OpenAlexW2069664592MaRDI QIDQ3719852

D. S. Franzblau, Daniel J. Kleitman

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80012-1

zbMATH Keywords

algorithmrectilinear polygoncomputational geometrypolyominominimum number of rectangles, with overlapping allowed

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)

Related Items (10)

Optimized location of light sources to cover a rectangular region ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ A weighted min-max relation for intervals ⋮ An algorithm for the difference between set covers ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Complexities of efficient solutions of rectilinear polygon cover problems ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Packing resizable items with application to video delivery over wireless networks ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ Finding minimum generators of path systems

This page was built for publication: An algorithm for covering polygons with rectangles