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 language||English (US)|
|Title of host publication||Annual Symposium on Foundations of Computer Science (Proceedings)|
|Number of pages||6|
|State||Published - 1984|
|Name||Annual Symposium on Foundations of Computer Science (Proceedings)|
All Science Journal Classification (ASJC) codes
- Hardware and Architecture