111
click to vote
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
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...