Optimal algorithm for intersecting three-dimensional convex polyhedra

Research output: Contribution to journalArticlepeer-review

74 Scopus citations


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 languageEnglish (US)
Pages (from-to)671-696
Number of pages26
JournalSIAM Journal on Computing
Issue number4
StatePublished - 1992

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics


Dive into the research topics of 'Optimal algorithm for intersecting three-dimensional convex polyhedra'. Together they form a unique fingerprint.

Cite this