Covering Polygons with Rectangles [chapter]

Roland Glück
2017 Lecture Notes in Computer Science  
A well-known and well-investigated family of hard optimization problems concerns variants of the cutting stock or nesting problem, i.e. the non-overlapping placing of polygons to be cut from a rectangle or the plane whilst minimizing the waste. Here we consider an in some sense inverse problem. Concretly, given a set of polygons in the plane, we seek the minimum number of rectangles of a given shape such that every polygon is covered by at least one rectangle. As motions of the given rectangle
more » ... e investigate the cases of translation and of translation combined with rotation. This is an extended abstract of a presentation given at EuroCG 2016. It has been made public for the benefit of the community and should be considered a preprint rather than a formally reviewed paper. Thus, this work is expected to appear in a conference with formal proceedings and/or in a journal.
doi:10.1007/978-3-319-55911-7_20 fatcat:ga3jmpqeqvg6dho55tj4iopgh4