An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance.

Martin E. Dyer Jonathan M. Nash Peter M. Dew

Published in: SPAA (1995)

Keyphrases

convex hull
simple polygon
dynamic programming
optimal solution
worst case
objective function
similarity measure
matching algorithm
computational geometry
finite set of points
recursive algorithm
knapsack problem
point sets
np hard
feasible solution
extreme points
closest point
decision trees