TY - GEN
T1 - SPACE SEARCHING FOR INTERSECTING OBJECTS.
AU - Dobkin, David P.
AU - Edelsbrunner, Herbert
N1 - Funding Information:
*This work was performed while the first author Was visiting at the Technical University of Graz during May and June 1983. tResearch of this author was supported in part by the National Science Foundation under Grant MCS83-03926 and DCRg5-05517. *Research of this author was supported by the Austrian Fonds zur Foerderung der wissenschaftlichen Forschung. Present address: Department of Computer Science, University of Illinois, Urbana, Illinois 61801.
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. The authors present 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. The authors present 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=0021540463&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021540463&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0021540463
SN - 081860591X
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 387
EP - 392
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -