Space searching for intersecting objects Dobkin, David Edelsbrunner, Herbert ; https://orcid.org/0000-0002-9823-6833 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, planes, and polyhedra in three dimensions. Academic Press 1987 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/4102 Dobkin D, Edelsbrunner H. Space searching for intersecting objects. <i>Journal of Algorithms</i>. 1987;8(3):348-361. doi:<a href="https://doi.org/10.1016/0196-6774(87)90015-0">10.1016/0196-6774(87)90015-0</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1016/0196-6774(87)90015-0 info:eu-repo/semantics/altIdentifier/issn/0196-6774 info:eu-repo/semantics/altIdentifier/e-issn/1090-2678 info:eu-repo/semantics/closedAccess