An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra

@article{Chazelle1992AnOA,
  title={An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra},
  author={Bernard Chazelle},
  journal={SIAM J. Comput.},
  year={1992},
  volume={21},
  pages={671-696}
}
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. 

Similar Papers

Loading similar papers…