A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra.
Andrew KlapperPublished in: Inf. Process. Lett. (1987)
Keyphrases
- convex hull
- lower bound
- convex polyhedra
- upper bound
- worst case
- extreme points
- feasible solution
- np hard
- integer points
- convex sets
- point sets
- optimal solution
- feature extraction
- sufficiently accurate
- mixed integer
- branch and bound algorithm
- training samples
- pairwise
- objective function
- branch and bound
- lagrangian relaxation
- minimum distance
- computational geometry
- data points
- simple polygon
- data sets