Randomized multidimensional search trees: further results in dynamic sampling
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 216-227
- https://doi.org/10.1109/sfcs.1991.185371
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Randomized multidimensional search trees: further results in dynamic samplingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamic maintenance of geometric structures made easyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Randomized multidimensional search trees: lazy balancing and dynamic shufflingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal randomized parallel algorithms for computational geometryAlgorithmica, 1992
- On levels in arrangements and voronoi diagramsDiscrete & Computational Geometry, 1991
- Hidden surface removal with respect to a moving view pointPublished by Association for Computing Machinery (ACM) ,1991
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Linear programming and convex hulls made easyPublished by Association for Computing Machinery (ACM) ,1990
- An efficient algorithm for hidden surface removalPublished by Association for Computing Machinery (ACM) ,1989
- Combinatorial complexity bounds for arrangements of curves and surfacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988