A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 rectangledoi:10.1007/978-3-319-55911-7_20 fatcat:ga3jmpqeqvg6dho55tj4iopgh4