An algorithm for covering polygons with rectangles. (English) Zbl 0591.68073
Summary: Decomposing a polygon into simple shapes is a basic problem in computational geometry, with applications in pattern recognition and integrated circuit manufacture. Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed. The problem is NP-hard. However, we give here an \(O(v^ 2)\) algorithm for constructing a minimum rectangle cover, when the polygon is vertically convex. (Here v is the number of vertices.) The problem is first reduced to a 1-dimensional interval ”basis” problem. In showing our algorithm produces an optimal cover we give a new proof of a minimum basis-maximum independent set duality theorem first proved by E. Györi [J. Comb. Theory, Ser. B 37, 1-9 (1984; Zbl 0551.05035)].
MSC:
68R99 | Discrete mathematics in relation to computer science |
05B40 | Combinatorial aspects of packing and covering |