A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
Dana S. RichardsJeffrey S. SalowePublished in: Algorithmica (1992)
Keyphrases
- point sets
- steiner tree
- point correspondences
- point pattern matching
- minimum spanning tree
- point cloud
- graph theory
- pairwise
- convex hull
- point set registration
- iterative closest point algorithm
- affine registration
- metric space
- hausdorff distance
- closest points
- principal axes
- three dimensional
- rigid registration
- index structure
- correspondence matching
- icp algorithm
- random walk
- viewpoint
- decision trees
- symmetric difference