Fast detection of polyhedral intersection

David P. Dobkin, David G. Kirkpatrick

Research output: Contribution to journalArticle

119 Scopus citations

Abstract

Methods are given for unifying and extending previous work on detecting intersections of suitably preprocessed polyhedra. New upper bounds of O(log n) and O(log2 n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.

Original languageEnglish (US)
Pages (from-to)241-253
Number of pages13
JournalTheoretical Computer Science
Volume27
Issue number3
DOIs
StatePublished - 1983

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Fast detection of polyhedral intersection'. Together they form a unique fingerprint.

  • Cite this