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)|
|Number of pages||26|
|Journal||SIAM Journal on Computing|
|State||Published - Jan 1 1992|
All Science Journal Classification (ASJC) codes
- Computer Science(all)