Abstract
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as low-dimensional linear programming and convex hulls are considered.
| Original language | English (US) |
|---|---|
| Pages | 180-189 |
| Number of pages | 10 |
| DOIs | |
| State | Published - 2005 |
| Externally published | Yes |
| Event | 21st Annual Symposium on Computational Geometry, SCG'05 - Pisa, Italy Duration: Jun 6 2005 → Jun 8 2005 |
Other
| Other | 21st Annual Symposium on Computational Geometry, SCG'05 |
|---|---|
| Country/Territory | Italy |
| City | Pisa |
| Period | 6/6/05 → 6/8/05 |
Keywords
- Convex hulls
- Linear programming
- Streaming algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics