A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets.
Ondrej BílkaKevin BuchinRadoslav FulekMasashi KiyomiYoshio OkamotoShin-ichi TanigawaCsaba D. TóthPublished in: Electron. J. Comb. (2010)
Keyphrases
- point sets
- lower bound
- upper bound
- point correspondences
- worst case
- iterative closest point algorithm
- pairwise
- point pattern matching
- objective function
- point cloud
- point matching
- distance function
- hausdorff distance
- point set registration
- optimal solution
- affine registration
- pattern set
- multiple views
- convex hull
- knn
- metric space
- principal axes
- learning algorithm
- icp algorithm
- distance transform
- database systems