Abstract
Chazelle [SIAM J Comput 21(4):671–696, 1992] gave a linear-time algorithm to compute the intersection of two convex polyhedra in three dimensions. We present a simpler algorithm to do the same.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 860-865 |
| Number of pages | 6 |
| Journal | Discrete and Computational Geometry |
| Volume | 56 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1 2016 |
| Externally published | Yes |
Keywords
- Convex polyhedra
- Dobkin–Kirkpatrick hierarchy
- Intersection
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics