Solving the Minimum Convex Partition of Point Sets with Integer Programming.
Allan SapucaiaPedro J. de RezendeCid C. de SouzaPublished in: CoRR (2020)
Keyphrases
- integer programming
- point sets
- convex hull
- integer program
- round robin tournament
- point pattern matching
- point correspondences
- set partitioning
- np hard
- lp relaxation
- linear programming
- point cloud
- iterative closest point algorithm
- cutting plane
- lagrangian relaxation
- column generation
- constraint programming
- convex programming
- cutting plane algorithm
- minimum cost
- distance function
- pairwise
- affine registration
- point set registration
- similarity measure
- families of valid inequalities
- min cut
- icp algorithm
- convex optimization
- linear program
- viewpoint
- search algorithm
- objective function