Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets.
Mikio KanoKenta NoguchiDavid OrdenPublished in: CoRR (2018)
Keyphrases
- point sets
- spanning tree
- edge disjoint
- geometric transformations
- bounded degree
- point correspondences
- point pattern matching
- minimum cost
- iterative closest point algorithm
- point cloud
- graph theoretic
- convex hull
- point set registration
- distance function
- pairwise
- affine registration
- bounded treewidth
- computer vision
- approximation algorithms