Optimal in-place planar convex hull algorithms (2002)
by
Hervé Brönnimann
,
John Iacono
,
Jyrki Katajainen
,
Pat Morin
,
Godfried Toussaint
| Venue: | Proceedings of Latin American Theoretical Informatics (LATIN 2002), volume 2286 of Lecture Notes in Computer Science |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Brönnimann02optimalin-place,
author = {Hervé Brönnimann and John Iacono and Jyrki Katajainen and Pat Morin and Godfried Toussaint},
title = {Optimal in-place planar convex hull algorithms},
booktitle = {Proceedings of Latin American Theoretical Informatics (LATIN 2002), volume 2286 of Lecture Notes in Computer Science},
year = {2002},
pages = {494--507},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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...
