Rotational Polygon Overlap Minimization

An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons P1, P2, P3, . . . , Pk in a container polygon Q, translate and rotate the polygons to diminish their overlap to a local minimum. A (local) overlap minimum has the property that any perturbation of the polygons increases the overlap. Overlap minimization is modified to create a practical algorithm for compaction: starting with a non-overlapping layout in a rectangular container, plan a non-overlapping motion that diminishes the length or area of the container to a local minimum. Experiments show that both overlap minimization and compaction work well in practice and are likely to be useful in industrial applications. © 1998 Published by Elsevier Science B.V.

• Type: Conference
• Year: 1997
• Where: COMPGEOM
• Authors: Victor Milenkovic
• Keywords: COMPGEOM 1997, Discrete Geometry, Overlap Minimization, Polygons, Rotational Overlap Minimization