Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets.
Glencora BorradaileDavid EppsteinPublished in: CCCG (2012)
Keyphrases
- point sets
- principal axes
- point correspondences
- traveling salesman problem
- pairwise
- point pattern matching
- point cloud
- convex hull
- three dimensional
- point set registration
- distance function
- iterative closest point algorithm
- closed form
- metric space
- hausdorff distance
- affine registration
- rigid registration
- derive a closed form solution
- distance measure
- high dimensional
- computer vision