Flip distance between two triangulations of a point set is NP-complete.
Anna LubiwVinayak PathakPublished in: Comput. Geom. (2015)
Keyphrases
- point sets
- np complete
- distance function
- hausdorff distance
- closest points
- point correspondences
- randomly generated
- np hard
- point pattern matching
- point cloud
- computational complexity
- pairwise
- convex hull
- graph matching
- distance measure
- icp algorithm
- affine registration
- point set registration
- conjunctive queries
- rigid registration
- closed form
- neural network
- data analysis
- closest point
- polynomial time complexity
- three dimensional