Space searching for intersecting objects
Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
Download
No fulltext has been uploaded. References only!
Journal Article
| Published
| English
Scopus indexed
Author
Dobkin, David;
Edelsbrunner, HerbertISTA 
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. 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.
Publishing Year
Date Published
1987-09-01
Journal Title
Journal of Algorithms
Volume
8
Issue
3
Page
348 - 361
ISSN
eISSN
IST-REx-ID
Cite this
Dobkin D, Edelsbrunner H. Space searching for intersecting objects. Journal of Algorithms. 1987;8(3):348-361. doi:10.1016/0196-6774(87)90015-0
Dobkin, D., & Edelsbrunner, H. (1987). Space searching for intersecting objects. Journal of Algorithms. Academic Press. https://doi.org/10.1016/0196-6774(87)90015-0
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms. Academic Press, 1987. https://doi.org/10.1016/0196-6774(87)90015-0.
D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” Journal of Algorithms, vol. 8, no. 3. Academic Press, pp. 348–361, 1987.
Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi:10.1016/0196-6774(87)90015-0.
Link(s) to Main File(s)
Access Level
Closed Access
Google Scholar