Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge).
Da Wei ZhengJack Spalding-JamiesonBrandon ZhangPublished in: SoCG (2020)
Keyphrases
- constraint programming
- point sets
- low cost
- convex hull
- search heuristics
- combinatorial search problems
- combinatorial problems
- search strategies
- propositional satisfiability
- backtrack search
- constraint satisfaction problems
- constraint propagation
- point correspondences
- constraint satisfaction
- global constraints
- point cloud
- point pattern matching
- pairwise
- combinatorial optimization
- finite domain
- point set registration
- systematic search
- optimal solution
- tabu search
- hard and soft constraints
- search space
- symmetry breaking
- viewpoint
- distance function
- feature selection
- search algorithm
- data mining