Abstract
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
Original language | English (US) |
---|---|
Pages (from-to) | 671-696 |
Number of pages | 26 |
Journal | SIAM Journal on Computing |
Volume | 21 |
Issue number | 4 |
DOIs | |
State | Published - 1992 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- General Mathematics