Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 484-493

  Kaplan, Haim ^a   Sharir, Micha ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; ERROR ANALYSIS; PROBLEM SOLVING; QUERY LANGUAGES;

PERMUTATION; QUERY; RANGE COUNTING; VORONOI DIAGRAMS;

RANDOM PROCESSES;

EID: 33244490258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109611     Document Type: Conference Paper

References (19)

1. P.K. Agarwal, J. Erickson, and L. Guibas, Kinetic binary space partitions for intersecting segments and disjoint triangles, Proc. 9th Annu. ACM-SIAM Sympos. Discrete Algo., 1998, 107-116.
2. P.K. Agarwal, L.J. Guibas, T.M. Murali, and J.S. Vitter, Cylindrical static and kinetic binary space partitions, Comput. Geom. Theory Appl. 16 (.2000), 103-127.
3. B. Aronov and S. Har-Peled, On approximating the depth and related problems, Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algo., 2005, 886-894.
4. B. Aronov and M. Sharir, Approximate range counting, in preparation.
5. M. de Berg, M. van Kreveld, M. Overmars and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd Edition, Springer verlag, Heidelberg, 2000.
6. T. M. Chan, Random Sampling, Halfspace Range Reporting, and Construction of (≤ k)-Levels in Three Dimensions, SIAM J. on Comput. 30 (2000), 561-575.
7. B. Chazelle, The Discrepancy Method, Cambridge University Press, Cambridge, UK, 2000.
8. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. Assoc. Comput. Mach., 39 (1992), 1-54.
9. K. Clarkson and P. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387-421.
10. E. Cohen, Size-estimation framework with applications to transitive closure and reachability, J. Comput. Syst. Sci. 55 (1997), 441-453.
11. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
12. H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1 (1986), 25-44.
13. L. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Voronoi and Delaunay diagrams, Algorithmica 7 (1992), 381-413.
14. M. E. Houle and G. T. Toussaint, Computing the width of a set, IEEE Trans. Pattern Anal. Mach. Intell. 10 (1988), 761-765.
15. D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Disc. Comput. Geom. 2 (1987), 127-151.
16. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl. 2 (1992), 169-186.
17. J. Matoušek, Range searching with efficient hierarchical cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
18. K. Mulmuley, A fast planar partition algorithm I, J. of Symbolic Computation, 10 (1990), 253-280.
19. E. A. Ramos, On range reporting, ray shooting and k-level construction, Proc. 15th Annu. ACM Sympos. Comput. Geom., (1999), 390-399.