Minimum-Cost Coverage of Point Sets by Disks
Esther M. ArkinHervé BrönnimannJeff EricksonSándor P. FeketeChristian KnauerJonathan LenchnerJoseph S. B. MitchellKim WhittleseyPublished in: CoRR (2006)
Keyphrases
- minimum cost
- point sets
- np hard
- network flow
- approximation algorithms
- point pattern matching
- point correspondences
- spanning tree
- network flow problem
- capacity constraints
- pairwise
- graph matching
- point set registration
- convex hull
- iterative closest point algorithm
- hausdorff distance
- metric space
- distance function
- point cloud
- affine registration
- neural network
- information theoretic
- worst case
- upper bound
- image sequences
- computer vision