New for: D3
be cut on a strip, minimizing the length of the strip. The polygon containment
problem (existence of a non overlapping allocation of n polygons in a polygon
container) is a natural decision problem associated with the marker making. We will
talk about these problems and the difficulties in finding an efficient approach
to solve them