A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set.
Kenneth R. AndersonPublished in: Inf. Process. Lett. (1978)
Keyphrases
- convex hull
- simple polygon
- finite set of points
- extreme points
- integer points
- dynamic programming
- recursive algorithm
- minimum distance
- np hard
- point sets
- feasible solution
- linear inequalities
- mixed integer
- closest point
- computational geometry
- learning algorithm
- finite number
- lower bound
- objective function
- voronoi diagram
- convex sets
- lower and upper bounds
- training samples
- optimal solution