Three Edge-Disjoint Plane Spanning Paths in a Point Set.
Philipp KindermannJan KratochvílGiuseppe LiottaPavel ValtrPublished in: GD (1) (2023)
Keyphrases
- point sets
- edge disjoint
- spanning tree
- total length
- point correspondences
- point cloud
- point pattern matching
- pairwise
- three dimensional
- convex hull
- affine registration
- shortest path
- distance function
- derive a closed form solution
- nearest neighbor searching
- rigid registration
- neural network
- data sets
- icp algorithm
- point set registration
- upper bound
- computational geometry
- minimum cost
- closest points