Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees.
Marcos OropezaCsaba D. TóthPublished in: DGCI (2019)
Keyphrases
- spanning tree
- point sets
- minimum spanning tree
- edge disjoint
- queueing systems
- point correspondences
- minimum cost
- minimum spanning trees
- point cloud
- graph matching
- weighted graph
- undirected graph
- edge weights
- convex hull
- transition probabilities
- pairwise
- three dimensional
- computer vision
- shortest path
- random walk
- boundary points
- reinforcement learning