Login / Signup

Space-E.cient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time.

Hervé BrönnimannTimothy M. Chan
Published in: LATIN (2004)
Keyphrases
  • convex hull
  • computational geometry
  • worst case
  • linear space
  • point sets
  • finite set of points
  • learning algorithm
  • recursive algorithm
  • voronoi diagram
  • infinite dimensional
  • minimum length