Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees.
Marcos OropezaCsaba D. TóthPublished in: Inf. Process. Lett. (2021)
Keyphrases
- spanning tree
- point sets
- minimum spanning tree
- edge disjoint
- queueing systems
- minimum cost
- point correspondences
- graph matching
- point cloud
- undirected graph
- transition probabilities
- minimum spanning trees
- weighted graph
- point set registration
- convex hull
- three dimensional
- edge weights
- pairwise
- distance function
- random walk
- directed graph
- probabilistic model
- special case