Flip Distance Between Two Triangulations of a Point Set is NP-complete.
Anna LubiwVinayak PathakPublished in: CCCG (2012)
Keyphrases
- point sets
- np complete
- distance function
- hausdorff distance
- closest points
- point correspondences
- point cloud
- computational complexity
- point set registration
- np hard
- point pattern matching
- distance measure
- nearest neighbor
- graph matching
- randomly generated
- pairwise
- convex hull
- rigid registration
- affine registration
- learning algorithm
- conjunctive queries
- nearest neighbor searching