SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Regular triangulations of dynamic sets of points
Computer Aided Geometric Design
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Library for Self-Adjusting Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A randomized technique, called dynamic shuffling, is given for multidimensional dynamic search. This technique, when specialized to the problem of searching in sorted lists, yields the previously known randomized binary trees (treaps). The crux of the technique is a multidimensional generalization of the rotation operation on binary search trees. Simultaneously, it is shown how to dynamize the randomized incremental algorithms so as to allow additions as well as deletions of objects. The techniques are based on remembering the history of the actual or imaginary sequence of updates. The techniques are applied to several problems in computational geometry.