# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Rotational polygon containment and minimum enclosure using only robust 2D constructions. (English) Zbl 0930.68152
Summary: An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons ${P}_{1},{P}_{2},{P}_{3},\cdots ,{P}_{k}$ 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 $𝒞$ of container polygons, find a container $C\in 𝒞$ of minimum area for which containment has a solution. The minimum enclosure is approximate: it bounds the minimum area between $\left(1-\epsilon \right)A$ and $A$. Experiments indicate that finding the minimum enclosure is practical for $k=2,3$ but not larger unless optimality is sacrificed or angles ranges are limited (although these solutions can still be useful). 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. In particular, it introduces nearest pair rounding, which allows all these calculations to be carried out in rounded floating point arithmetic.
##### MSC:
 68U05 Computer graphics; computational geometry
##### Keywords:
rotational polygon containment