DMCA
Rotational Polygon Overlap Minimization (1997)
| Venue: | Computational Geometry: Theory and Applications |
| Citations: | 5 - 1 self |
BibTeX
@INPROCEEDINGS{Milenkovic97rotationalpolygon,
author = {Victor J. Milenkovic},
title = {Rotational Polygon Overlap Minimization},
booktitle = {Computational Geometry: Theory and Applications},
year = {1997},
pages = {305--318},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 C, translate and rotate the polygons to a layout that minimizes an overlap measure. A (local) overlap minimum has the property that any perturbation of the polygons increases the chosen measure of overlap. Experiments show that the algorithm works well in practice. It is shown how to apply overlap minimization to create algorithms for other layout tasks: compaction, containment, and minimal enclosure. Compaction: starting with a non-overlapping layout in a rectangular container, plan a non-overlapping motion that minimizes the length or area of the container. Containment: place the polygons into a (possibly non-convex container) without overlapping. Minimal enclosure: find a non-overlapping layout inside a minimum-length, fixed-width rectangle or inside a minimum area rectangle. All of these algorithms have important i...
Keyphrases
rotational polygon overlap minimization minimal enclosure non-overlapping layout minimum area rectangle container polygon fast algorithm non-overlapping motion chosen measure overlap minimization non-convex container rectangular container overlap measure fixed-width rectangle rotational overlap minimization polygon p1 layout task
