| 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 (251 kB) |
| DOI: | 10.1016/j.tcs.2003.05.004 |
| 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 (Conference paper) HTML (Slides) |
| BibLATEX: | @article{BIKMMT2004J,
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},
}
|