The implementation of an algorithm to find the convex hull of a set of three-dimensional points.
A. M. DayPublished in: ACM Trans. Graph. (1990)
Keyphrases
- convex hull
- finite set of points
- point sets
- three dimensional
- closest points
- simple polygon
- computational geometry
- minimum distance
- closest point
- extreme points
- convex sets
- mixed integer
- feasible solution
- linear inequalities
- simulated annealing
- recursive algorithm
- point pairs
- learning algorithm
- data sets
- continuous variables
- feature space
- convex polyhedra
- integer points
- voronoi diagram
- linear programming
- boundary points
- face images
- active learning
- reinforcement learning