SPACE SEARCHING FOR INTERSECTING OBJECTS.

David P. Dobkin, Herbert Edelsbrunner

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

8 Scopus citations

Abstract

Determining or counting geometric objects that intersect another geometric query object is at the core of algorithmic problems in a number of applied areas of computer science. The authors present a family of space-efficient data structures that realize sublinear query time for points, line segments, lines, and polygons in the plane and points, line segments, planes, and polyhedra in three dimensions.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages387-392
Number of pages6
ISBN (Print)081860591X
StatePublished - Dec 1 1984

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'SPACE SEARCHING FOR INTERSECTING OBJECTS.'. Together they form a unique fingerprint.

  • Cite this

    Dobkin, D. P., & Edelsbrunner, H. (1984). SPACE SEARCHING FOR INTERSECTING OBJECTS. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 387-392). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE.