Sciweavers

COMPGEOM
1997
ACM
13 years 9 months ago
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 an...
Victor Milenkovic