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