The Polytope of Non-Crossing Graphs on a Planar Point Set.
David OrdenFrancisco SantosPublished in: Discret. Comput. Geom. (2005)
Keyphrases
- point sets
- graph matching
- convex hull
- directed graph
- point correspondences
- point pattern matching
- point cloud
- pairwise
- iterative closest point algorithm
- hamiltonian cycle
- planar graphs
- point set registration
- lattice points
- affine registration
- closest points
- rigid registration
- icp algorithm
- boundary points
- data points
- computational geometry
- distance function
- similarity search
- training samples
- multi view
- decision trees
- image processing