Covering a rectilinear polygon with rectangles
In orthogonally convex polygons, the number of rectangles in a minimum covering is equal to the number of blocks in an anti rectangle, and this fact can be used to build a polynomial time algorithm for finding a minimum covering by rectangles.
Here we examine the special case of covering a rectilinear polygon (or polyomino) with the minimum number of rectangles, with overlapping allowed.
Jun 2, 2013 · Use rectangles of the same size (representing a sensor coverage) to cover the polygon. The edge of the polygon and rectangle are parallel with the coordinate ...
Dec 13, 2023 · We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned rectangles such ...
Abstract: Three approximation algorithms to cover a rectilinear polygon that is neither horizontally nor vertically convex by rectangles are developed.
Sep 25, 2014 · In this Master Thesis we consider the problem of covering rectilinear polygons by the minimum number of axis-parallel rectangles.
We consider the problem of covering rectilinear polygons with axis-parallel rectangles. Given a rectilinear polygon P with vertical complexity n, this problem ...
May 3, 2011 · I am trying to determine a quick algorithm to find a small number of rectangles which can fill in this shape.
The rectilinear polygon cover problem is one in which a certain class of features of a rectilinear polygon of n vertices has to be covered with the minimum ...
People also ask
What is the rectangle cover problem?
Can polygons be rectangles?
Is a polygon a rectilinear shape?
Is a rectangle a regular polygon or an irregular polygon?
Abstract-Three approximation algorithms to cover a rectilinear polygon that is neither horizontally nor vertically convex by rectangles are developed.