Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time.

Hervé Brönnimann Timothy M. Chan

Published in: Comput. Geom. (2006)

Keyphrases

convex hull
simple polygon
efficient algorithms for computing
finite set of points
computational geometry
minimum length
linear space
point sets
parameter space
convex polyhedra
voronoi diagram
mixed integer
feasible solution
face recognition
machine learning
higher dimensional
probabilistic model
search space