Abstract
This paper gives lower and upper bounds on the complexity of triangulating the region between polyhedra. Particular attention is given to the case of convex polyhedra and terrains.
Original language | English (US) |
---|---|
Pages (from-to) | 429-444 |
Number of pages | 16 |
Journal | Discrete & Computational Geometry |
Volume | 14 |
Issue number | 1 |
DOIs | |
State | Published - Dec 1995 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics