The polytope of non-crossing graphs on a planar point set.
David OrdenFrancisco SantosPublished in: ISSAC (2004)
Keyphrases
- point sets
- graph matching
- convex hull
- directed graph
- point pattern matching
- point correspondences
- point cloud
- iterative closest point algorithm
- planar graphs
- pairwise
- lattice points
- hamiltonian cycle
- point set registration
- closest points
- neural network
- icp algorithm
- affine registration
- distance function
- nearest neighbor searching
- nearest neighbor
- computational geometry
- iterative closest point
- boundary points
- training samples
- mutual information
- training data