Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge).
Laurent MoalicDominique SchmittJulien LepagnotJulien KritterPublished in: SoCG (2020)
Keyphrases
- point sets
- low cost
- convex hull
- point correspondences
- point pattern matching
- point set registration
- iterative closest point algorithm
- point cloud
- principal axes
- pairwise
- point matching
- metric space
- hausdorff distance
- affine registration
- distance function
- viewpoint
- data sets
- icp algorithm
- feature space
- clustering algorithm