On the expected diameter, width, and complexity of a stochastic convex-hull.
Jie XueYuan LiRavi JanardanPublished in: CoRR (2017)
Keyphrases
- convex hull
- convex polyhedra
- point sets
- convex sets
- simple polygon
- computational geometry
- worst case
- mixed integer
- feasible solution
- continuous relaxation
- minimum distance
- knapsack problem
- convex concave
- data sets
- training samples
- data points
- voronoi diagram
- high resolution
- computational complexity
- optimal solution
- learning algorithm
- machine learning