Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0904.68174
Milenkovic, Victor J.
Rotational polygon overlap minimization and compaction. (English)
[J] Comput. Geom. 10, No.4, 305-318 (1998). ISSN 0925-7721

Summary: An effective and fast algorithm is given for rotational overlap minimization: given an overlapping layout of polygons $P_1, P_2, P_3, \dots, P_k$ 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.

MSC 2000:: *68U05 Computational geometry, etc.

Keywords: rotational overlap minimization

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]