On the expected diameter, width, and complexity of a stochastic convex hull.
Jie XueYuan LiRavi JanardanPublished in: Comput. Geom. (2019)
Keyphrases
- convex hull
- computational complexity
- training samples
- mixed integer
- computational geometry
- convex polyhedra
- simple polygon
- convex concave
- extreme points
- worst case
- feasible solution
- point sets
- integer points
- data sets
- minimum distance
- convex sets
- supply chain
- upper bound
- high dimensional
- face recognition
- learning algorithm