Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge).
Günther EderMartin HeldStefan de LorenzoPeter PalfraderPublished in: SoCG (2020)
Keyphrases
- point sets
- low cost
- convex hull
- point correspondences
- point pattern matching
- iterative closest point algorithm
- point cloud
- principal axes
- metric space
- pairwise
- point matching
- affine registration
- point set registration
- icp algorithm
- distance function
- neural network
- hausdorff distance
- similarity searching
- semi supervised
- learning algorithm