An O(N) algorithm for computing the convex hull of a finite set of planar points.
Qin-Zhong YePublished in: Neural Parallel Sci. Comput. (1997)
Keyphrases
- convex hull
- finite set of points
- simple polygon
- point sets
- extreme points
- integer points
- closest point
- minimum distance
- optimal solution
- np hard
- recursive algorithm
- mixed integer
- computational geometry
- convex sets
- closest points
- point pairs
- learning algorithm
- linear inequalities
- data points
- finite number
- feasible solution
- convex polyhedra
- nearest point
- data sets
- lower and upper bounds
- continuous variables
- geometric constraints
- search space
- training data
- similarity measure
- face recognition