Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points.

Karl Heinz Borgwardt

Published in: Discret. Comput. Geom. (1997)

Keyphrases

simulated annealing
convex hull
metaheuristic
learning algorithm
point sets
finite set of points
dynamic programming
data points
computational geometry
closest point
image processing
space complexity
minimum distance
extreme points
convex polyhedra