A note on a QPTAS for maximum weight triangulation of planar point sets.
Christos LevcopoulosAndrzej LingasPublished in: Inf. Process. Lett. (2014)
Keyphrases
- point sets
- maximum weight
- bipartite graph
- independent set
- minimum weight
- point correspondences
- partial order
- point pattern matching
- point cloud
- weighted graph
- np hard
- graph matching
- distance function
- range data
- point set registration
- convex hull
- metric space
- feature points
- lower bound
- object recognition
- training data
- three dimensional