Solving the minimum convex partition of point sets with integer programming.
Allan SapucaiaPedro J. de RezendeCid C. de SouzaPublished in: Comput. Geom. (2021)
Keyphrases
- integer programming
- point sets
- convex hull
- integer program
- point correspondences
- round robin tournament
- linear programming
- point pattern matching
- iterative closest point algorithm
- np hard
- constraint programming
- point cloud
- column generation
- lp relaxation
- cutting plane
- set partitioning
- convex programming
- lagrangian relaxation
- cutting plane algorithm
- exact methods
- pairwise
- valid inequalities
- convex optimization
- distance function
- minimum cost
- icp algorithm
- point set registration
- lower bound
- affine registration
- linear program
- constraint satisfaction
- information theoretic
- data points
- high dimensional