Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
D.P. Dobkin , Princeton University
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. This article presents 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, plaraes, and polyhedra in three dimensions.
D.P. Dobkin, H. Edelsbrunner, "Space Searching For Intersecting Objects", FOCS, 1984, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1984, pp. 387-392, doi:10.1109/SFCS.1984.715939