article published yes David Dobkin author Herbert Edelsbrunner author 3FB178DA-F248-11E8-B48F-1D18A9856A870000-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 Press1987 eng 0196-6774 1090-267810.1016/0196-6774(87)90015-0 83348 - 361 yes Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>. Academic Press, 1987. <a href="https://doi.org/10.1016/0196-6774(87)90015-0">https://doi.org/10.1016/0196-6774(87)90015-0</a>. D. Dobkin, H. Edelsbrunner, Journal of Algorithms 8 (1987) 348–361. Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361. Dobkin, D., &#38; Edelsbrunner, H. (1987). Space searching for intersecting objects. <i>Journal of Algorithms</i>. Academic Press. <a href="https://doi.org/10.1016/0196-6774(87)90015-0">https://doi.org/10.1016/0196-6774(87)90015-0</a> D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” <i>Journal of Algorithms</i>, vol. 8, no. 3. Academic Press, pp. 348–361, 1987. Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi:<a href="https://doi.org/10.1016/0196-6774(87)90015-0">10.1016/0196-6774(87)90015-0</a>. 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> 41022018-12-11T12:06:57Z2022-02-03T13:47:53Z