Minimum-cost coverage of point sets by disks.
Helmut AltEsther M. ArkinHervé BrönnimannJeff EricksonSándor P. FeketeChristian KnauerJonathan LenchnerJoseph S. B. MitchellKim WhittleseyPublished in: SCG (2006)
Keyphrases
- minimum cost
- point sets
- np hard
- point correspondences
- network flow
- approximation algorithms
- point pattern matching
- spanning tree
- point cloud
- network flow problem
- capacity constraints
- convex hull
- iterative closest point algorithm
- point matching
- point set registration
- affine registration
- graph matching
- closed form
- pairwise
- metric space
- icp algorithm
- distance function
- hausdorff distance
- lower bound
- neural network