Rotational polygon containment and minimum enclosure

Research output: Contribution to conferencePaperpeer-review

20 Scopus citations


An algorithm and implementation is given for rotational polygon containment: given polygons P1, P2, P3,..., Pk and a container polygon C, find rotations and translations for the k polygons that place them into the container without overlapping. A version of the algorithm and implementation also solves rotational minimum enclosure: given a class C of container polygons, find a container C∈C of minimum area for which containment has a solution. Minimum enclosure algorithms are given for the following classes: 1) rectangles of fixed width, 2) scaled copies of a fixed convex polygon, 3) arbitrary rectangles. Containment and minimum enclosure are NP-hard (even in the purely translational case). The minimum enclosure is approximate: it bounds the minimum area between (1 - ε)A and A. Experiments are done to determine the largest practical value of k for both containment and minimum enclosure. Important applications for these algorithm to industrial problems are discussed. The paper also gives practical algorithms and numerical techniques for robustly calculating polygon set intersection, Minkowski sum, and range intersection: the intersection of a polygon with itself as it rotates through a range of angles.

Original languageEnglish (US)
Number of pages8
StatePublished - 1998
EventProceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA
Duration: Jun 7 1998Jun 10 1998


OtherProceedings of the 1998 14th Annual Symposium on Computational Geometry
CityMinneapolis, MN, USA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'Rotational polygon containment and minimum enclosure'. Together they form a unique fingerprint.

Cite this