Randomized multidimensional search trees: Dynamic sampling

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1991, Pages 121-131

  Mulmuley, Ketan ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLENDING; COMPUTATIONAL GEOMETRY; QUERY PROCESSING;

DYNAMIC SAMPLING; INCREMENTAL ALGORITHM; MULTIDIMENSIONAL GENERALIZATION; MULTIDIMENSIONAL SEARCH; RANDOMIZED INCREMENTAL ALGORITHMS; RANDOMIZED SEARCH; SEARCH STRUCTURES; VORONOI DIAGRAMS;

BINARY TREES;

EID: 84992479091     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/109648.109662     Document Type: Conference Paper

References (21)

1. A. Agarwal, L. Guibas, J. Saxe, P. Shor, "A linear time algorithm for computing the Voronoi diagram of a convex polygon", Proc. of the Ann. ACM Symposium on Theory of Computing, 87.
2. C. Aragon, R. Seidel, Randomized search trees, Proc. of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 540-545.
3. Boissonnat J., Teillaud M., On the randomized construction of the Delauney tree, Technical Report 1140, INRIA (France), 1989.
4. K. Clarkson, New applications of random sampling in computational geometry, Disc and Comp. Geo., 1987, pp. 195-222.
5. K. Clarkson, P. Shor, Applications of random sampling in computational geometry, II, Disc, and Comp. Geo. 4:387-421 (1989).
6. S. Cheng, R. Janardan, New results on dynamic planar point location, Proc. of the FOCS, 1990.
7. O. Devillers, S. Meiser, M. Teillaud, "Fully dynamic Delauney triangulation in logarithmic expected time per operation", manuscript.
8. O. Fries, K. Mehlhorn, S. Naeher, Dynamization of geometric data structures, Proc. of the first A CM Symp. on Comp. Geom., 1985, pp. 168-176.
9. L. Guibas, D. Knuth, M. Sharir, Randomized incremental construction of Delauney and Voronoi diagrams, Technical report 481, Courant institute of mathematical sciences, December, 1989.
10. D. Haussler, E. Welzl, ϵ-nets and simplex range queries, Disc, and Comp. Geom., 2(2), 1987, pp. 127-152.
11. K. Mulmuley, A fast planar partition algorithm, I, Proc of the 29th FOCS, 1988, pp. 580-589.
12. K. Mulmuley, A fast planar partition algorithm, II, Proc. of the fifth ACM Symp. on Comp. Geom. 1989.
13. K. Mulmuley, "An efficient algorithm for hidden surface removal", Proceeddings of the ACM SIGGRAPH, Computer Graphics, Vol. 23, Number 3, 1989.
14. K. Mulmuley, "An efficient algorithm for hidden surface removal, II", TO appear in the special issue of Journal of Alg. on FOCS 1990.
15. K. Mulmuley, "On levels in arrangements and Voronoi diagrams", to appear in Disc. and Comp. Geom. An abstract of this paper can be found in "On obstructions in relation to a fixed viewpoint", the proceedings of the FOCS 89.
16. K. Mulmuley, S. Sen, Dynamic point location in arrangements of hyperplanes, this volume.
17. M. Overmars, The design of dynamic data structures, Lecture notes in computer science, Springer-Verlag, 1983.
18. F. Preparata, R. Tamassia, Fully dynamic point location in a monotone subdivision, SIAM J. of Comp., 18(1989), pp. 811-830.
19. W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Comm. ACM, vol. 33, no. 6, June 1990, pp. 668-676.
20. Seidel R., private communication.
21. Sen S., Maintaining arrangements for point location, Bell labs technical memorandum.