Space-efficient planar convex hull algorithms
Authors:Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint
Published in:Theoretical Computer Science 321,1 (2004), 25–40
Full text:<pdf.gif>PDF (251 kB)  
Copyright:© Elsevier Science Publishers
Abstract:A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.
Related:<html.gif>HTML (Conference paper)  <html.gif>HTML (Slides)  
  author = {Herv\'{e} Br\"{o}nnimann and John Iacono and Jyrki Katajainen and
    Pat Morin and Jason Morrison and Godfried Toussaint},
  title = {Space-efficient planar convex hull algorithms},
  journaltitle = {Theoretical Computer Science},
  volume = {321},
  number = {1},
  year = {2004},
  pages = {25--40},
This page was generated by Jyrki Katajainen <> on 2018-04-01.