A convex hull algorithm for points with approximately known positions.
Paolo Giulio FranciosaCarlo GaibissoGiorgio GambosiMaurizio TalamoPublished in: Int. J. Comput. Geom. Appl. (1994)
Keyphrases
- convex hull
- finite set of points
- simple polygon
- recursive algorithm
- computational geometry
- np hard
- learning algorithm
- point sets
- extreme points
- high resolution
- matching algorithm
- mixed integer
- minimum distance
- closest point
- closest points
- convex polyhedra
- training samples
- search space
- optimal solution
- objective function
- similarity measure
- data sets