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.
Original language | English (US) |
---|---|
Pages (from-to) | 25-40 |
Number of pages | 16 |
Journal | Theoretical Computer Science |
Volume | 321 |
Issue number | 1 |
DOIs | |
State | Published - Jun 16 2004 |
Event | Latin American Theoretical Informatics - Cancun, Mexico Duration: Apr 3 2002 → Apr 6 2002 |
Keywords
- Computational geometry
- Convex hulls
- In situ
- In-place
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science