An algorithm for covering polygons with rectangles
From MaRDI portal
Publication:3719852
DOI10.1016/S0019-9958(84)80012-1zbMath0591.68073MaRDI QIDQ3719852
Daniel J. Kleitman, D. S. Franzblau
Publication date: 1984
Published in: Information and Control (Search for Journal in Brave)
algorithm; rectilinear polygon; computational geometry; polyomino; minimum number of rectangles, with overlapping allowed
05B40: Combinatorial aspects of packing and covering
68R99: Discrete mathematics in relation to computer science
Related Items
Complexities of efficient solutions of rectilinear polygon cover problems, An algorithm for the difference between set covers, A weighted min-max relation for intervals, Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs, Finding minimum generators of path systems, Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems, Jump Number of Two-Directional Orthogonal Ray Graphs