Space-efficient planar convex hull algorithms (2002)
Cached
Download Links
- [cg.scs.carleton.ca]
- [www-cgrl.cs.mcgill.ca]
- [jeff.cs.mcgill.ca]
- DBLP
Other Repositories/Bibliography
by
Herve Brönnimann
,
John Iacono
,
Jyrki Katajainen
,
Pat Morin
,
Jason Morrison
,
Godfried Toussaint
| Venue: | Proc. Latin American Theoretical Informatics |
| Citations: | 17 - 1 self |
BibTeX
@INPROCEEDINGS{Brönnimann02space-efficientplanar,
author = {Herve Brönnimann and John Iacono and Jyrki Katajainen and Pat Morin and Jason Morrison and Godfried Toussaint},
title = {Space-efficient planar convex hull algorithms},
booktitle = { Proc. Latin American Theoretical Informatics},
year = {2002},
pages = {494--507},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
