Abstract
We propose 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 (from-to) | 79-102 |
| Number of pages | 24 |
| Journal | Discrete and Computational Geometry |
| Volume | 37 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2007 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics