Given some polygon and rectangles all of a fixed height and width, how I can calculate the number and placement of the rectangles so that no point within or on the polygon is not contained within at least one rectangle. The rectangles are allowed to contain area that is not contained by the polygon and are allowed to overlap. The polygon can't be self-intersecting, but other than that anything goes. The polygon lies on a grid, there is given list of the polygon's vertices, and the rectangle's lengths are defined in grid units.
This abstract here seems to cover the topic I'm interested in, but I can't seem to find anything beyond the abstract.