Optimal algorithm for intersecting three-dimensional convex polyhedra

Research output: Contribution to journalArticle

65 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Mathematics(all)

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

  • Cite this