Randomized multidimensional search trees: further results in dynamic sampling (extended abstract)

Authors:
Ketan Mulmuley
Affiliations:
-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 6

Ray shooting and parametric search

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Ray shooting in convex polytopes

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Vertical decompositions for triangles in 3-space

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Geometric range searching

ACM Computing Surveys (CSUR)
Locality-preserving hashing in multidimensional spaces

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of randomization in dynamic search structures by means of a technique called dynamic sampling is investigated. In particular, an efficient algorithm for dynamic (logarithmic time) point location in 3-D partitions induced by a set of possibly interesting polygons in R/sup 3/ is given. The expected running time of the algorithm on a random sequence of updates is close to optimal. Efficient algorithms for dynamic nearest-k-neighbor queries and half space range queries in R/sup d/ are also given.