| In-place planar convex hull algorithms | |
| Authors: | Hervé Brönnimann, John Iacono, Jyrki Katajainen, Pat Morin, Jason Morrison, and Godfried Toussaint |
| Published in: | Proceedings of the 5th Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science 2286, Springer-Verlag (2002), 197–205 |
| Full text: |  PDF (240 kB) |
| DOI: | 10.1007/3-540-45995-2_43 |
| Copyright: | © Springer-Verlag |
| Abstract: | An in-place 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. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others... |
| Related: |  HTML (Journal article) HTML (Slides) |
| BibLATEX: | @inproceedings{BIKMMT2002C,
author = {Herv\'{e} Br\"{o}nnimann and John Iacono and Jyrki Katajainen and
Pat Morin and Jason Morrison and Godfried Toussaint},
title = {In-place planar convex hull algorithms},
booktitle = {Proceedings of the 5th Latin American Theoretical Informatics
Symposium},
series = {Lecture Notes in Computer Science},
volume = {2286},
publisher = {Springer-Verlag},
year = {2002},
pages = {197--205},
}
|