TY - GEN
T1 - Space search inc for intersecting objects
AU - Dobkin, David P.
AU - Edelsbrunner, Herbert
N1 - Publisher Copyright:
© 1984 IEEE.
PY - 1984
Y1 - 1984
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85115255481&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85115255481&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85115255481
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 387
EP - 392
BT - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984
PB - IEEE Computer Society
T2 - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984
Y2 - 24 October 1984 through 26 October 1984
ER -