The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Alain FinkelJérôme LerouxPublished in: CoRR (2008)
Keyphrases
- convex hull
- integer points
- convex sets
- linear inequalities
- extreme points
- mixed integer
- computational geometry
- convex polyhedra
- machine learning
- minimum distance
- totally unimodular
- simple polygon
- continuous relaxation
- point pairs
- feasible solution
- point sets
- training samples
- data points
- high dimensional
- decision trees