Fast detection of polyhedral intersections

David P. Dobkin, David G. Kirkpatrick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

24 Scopus citations


Methods are given for unifying and extending previous work on detecting polyhedral intersections. The technique of dynamic (vs. static) description is introduced and used to extend previous results. New upper bounds of O(log n) and O(log2n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 9th Colloquium
EditorsMogens Nielsen, Erik Meineche Schmidt
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540115762
StatePublished - 1982
Event9th International Colloquium on Automata, Languages and Programming, ICALP 1982 - Aarhus, Denmark
Duration: Jul 12 1982Jul 16 1982

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume140 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other9th International Colloquium on Automata, Languages and Programming, ICALP 1982

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


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

Cite this