Flip Distance Between Triangulations of a Planar Point Set is NP-Complete
Alexander PilzPublished in: CoRR (2012)
Keyphrases
- point sets
- np complete
- distance function
- closest points
- hausdorff distance
- point correspondences
- point cloud
- randomly generated
- point pattern matching
- np hard
- pairwise
- graph matching
- distance measure
- convex hull
- conjunctive queries
- computational complexity
- point set registration
- surface patches
- icp algorithm
- closest point
- affine registration
- similarity search
- video sequences
- viewpoint
- data exchange
- rigid registration
- nearest neighbor
- data sets