The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
Alain FinkelJérôme LerouxPublished in: Inf. Process. Lett. (2005)
Keyphrases
- convex hull
- integer points
- linear inequalities
- convex sets
- convex polyhedra
- extreme points
- point sets
- mixed integer
- data sets
- computational geometry
- totally unimodular
- feasible set
- continuous variables
- finite set of points
- closest point
- point pairs
- feasible solution
- feature vectors
- video sequences
- image processing
- machine learning