57 search results - page 2 / 12 » Rotationally Monotone Polygons |
COMPGEOM
1998
ACM
13 years 10 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
IPL
2000
13 years 5 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
COMPGEOM
1997
ACM
13 years 10 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...
CCCG
2006
13 years 7 months ago
2006
CCCG
2008
13 years 7 months ago
2008
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...