Flip Distance Between Two Triangulations of a Point-Set is NP-complete
Anna LubiwVinayak PathakPublished in: CoRR (2012)
Keyphrases
- point sets
- np complete
- distance function
- hausdorff distance
- closest points
- point correspondences
- point cloud
- np hard
- distance measure
- graph matching
- computational complexity
- point set registration
- point pattern matching
- randomly generated
- convex hull
- affine registration
- pairwise
- conjunctive queries
- nearest neighbor
- rigid registration
- polynomial time complexity
- similarity search
- icp algorithm
- data analysis
- nearest neighbor searching
- range images
- knn
- active learning
- object recognition