Semialgebraic range reporting and emptiness searching with applications

SIAM Journal on Computing

Volumn 40, Issue 4, 2011, Pages 1045-1074

  Sharir, Micha ^a,b   Shaul, Hayim ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Elementary cell partition; Epsilon nets; Random sampling; Range emptiness; Range reporting; Range searching; Ray shooting; Semialgebraic sets

Indexed keywords

EPSILON NETS; RANDOM SAMPLING; RANGE EMPTINESS; RANGE REPORTING; RANGE SEARCHING; RAY SHOOTING; SEMI-ALGEBRAIC SETS;

DATA STRUCTURES; GEOMETRY; SET THEORY;

ALGORITHMS;

EID: 80053198847     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090765092     Document Type: Review

References (39)

1. P. K. Agarwal, Applications of a new space partition technique, in Proceedings of the 2nd Workshop Algorithms Data Struct., Lecture Notes in Comput. Sci. 519, Springer, Berlin, 1991, pp. 379-392.
2. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
3. P. K. Agarwal and J. Matoušek, On range searching with semialgebraic sets, Discrete Comput. Geom., 11 (1994), pp. 393-418.
4. P. K. Agarwal and J. Matoušek, Dynamic half-space range reporting and its applications, Algorithmica, 13 (1995), pp. 325-345.
5. P. K. Agarwal, J. Matoušek, and O. Schwarzkopf, Computing many faces in arrangements of lines and segments, SIAM J. Comput., 27 (1998), pp. 491-505.
6. P. K. Agarwal, J. Pach, and M. Sharir, State of the union (of geometric objects), in Proceedings of the Joint Summer Research Conference on Discrete and Computational Geometry: 20 Years Later, Contemp. Math. 452, AMS, 2008, pp. 9-48.
7. P. K. Agarwal and M. Sharir, Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions, Discrete Comput. Geom., 24 (2000), pp. 645-685.
8. B. Aronov, P. Bose, E. D. Demaine, J. Gudmundsson, J. Iacono, S. Langerman, and M. Smid, Data structure for halfplane proximity queries and incremental Voronoi diagrams, in Proceedings of the 7th Latin American Symposium on Theoretical Information, Lecture Notes in Comput. Sci. 3887, Springer, Berlin, 2006, pp. 80-92.
9. B. Aronov, M. de Berg, E. Ezra, and M. Sharir, Improved bounds for the union of locally γ-fat objects, manuscript, 2010.
10. B. Aronov and S. Har-Peled, On approximating the depth and related problems, SIAM J. Comput., 38 (2008), pp. 899-921.
11. B. Aronov, S. Har-Peled, and M. Sharir, On approximate halfspace range counting and relative epsilon-approximations, in Proceedings of the 23rd ACM Symposium Comput. Geom., 2007, pp. 327-336.
12. B. Aronov and M. Sharir, Approximate halfspace range counting, SIAM J. Comput., 39 (2010), pp. 2704-2725.
13. S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, 2nd ed., Springer, New York, 2006.
14. B. Chazelle, H. Edelsbrunner, L. J. Guibas, and M. Sharir, A singly exponential stratification scheme for real semialgebraic varieties and its applications, Theoret. Comput. Sci., 84 (1991), pp. 77-105.
15. B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry, Combinatorica, 10 (1990), pp. 229-249.
16. O. Daescu, N. Mi, C. Shin, and A. Wolff, Farthest-point queries with geometric and combinatorial constraints, Comput. Geom. Theory Appl., 33 (2006), pp. 174-185.
17. O. Daescu and R. Serfling, Extremal point queries with lines and line segments and related problems, Comput. Geom. Theory Appl., 32 (2005), pp. 223-237.
18. M. de Berg, Better bounds for the union complexity of locally fat objects, in Proceedings of the 26th ACM Sympos. on Comput. Geom., 2010, pp. 39.47.
19. A. Efrat, The complexity of the union of (α, β)-covered objects, SIAM J. Comput., 34 (2005), pp. 775-787.
20. A. Efrat and M. Katz, On the union of K-curved objects, Comput. Geom. Theory Appl., 14 (1999), pp. 241-254.
21. A. Efrat and M. Sharir, The complexity of the union of fat objects in the plane, Discrete Comput. Geom., 23 (2000), pp. 171-189.
22. E. Ezra, On the union of cylinders in three dimensions, Discrete Comput. Geom., 45 (2011), pp. 45-64.
23. E. Ezra, B. Aronov, and M. Sharir, Improved bound for the union of fat triangles, in Proceedings of the 22nd ACM-SIAM Symp. on Discrete Algorithms, 2011, pp. 1778-1785.
24. G. D. da Fonseca and D. M. Mount, Approximate range searching: The absolute model, Comput. Geom., 43 (2010), pp. 434-444.
25. D. Haussler and E. Welzl, Epsilon nets and simplex range queries, Discrete Comput. Geom., 2 (1987), pp. 127-151.
26. S. Har-Peled and M. Sharir, Relative p, E-approximations in geometry, Discrete Comput. Geom., 45 (2011), pp. 462-496.
27. H. Kaplan, E. Ramos, and M. Sharir, Range minima queries with respect to a random permutation, and approximate range counting, Discrete Comput. Geom., 45 (2011), pp. 3-33.
28. V. Koltun, Almost tight upper bounds for vertical decomposition in four dimensions, J. ACM, 51 (2004), pp. 699-730.
29. Y. Li, P. M. Long, and A. Srinivasan, Improved bounds on the sample complexity of learning, J. Comput. System Sci., 62 (2001), pp. 516-527.
30. J. Matoušek, Reporting points in halfspaces, Comput. Geom. Theory Appl., 2 (1992), pp. 169-186.
31. J. Matoušek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
32. J. Matoušek, J. Pach, M. Sharir, S. Sifrony, and E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput., 23 (1994), pp. 154-169.
33. N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM, 30 (1983), pp. 852-865.
34. S. Mohaban and M. Sharir, Ray shooting amidst spheres in 3 dimensions and related problems, SIAM J. Comput., 26 (1997), pp. 654-674.
35. M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom., 12 (1994), pp. 327-345.
36. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge-New York-Melbourne, 1995.
37. M. Sharir and H. Shaul, Ray shooting and stone throwing with near-linear storage, Comput. Geom. Theory Appl., 30 (2005), pp. 239-252.
38. M. Sharir and H. Shaul, Ray shooting amid balls, farthest point from a line, and range emptiness searching, in Proceedings of the 16th ACM-SIAM Symp. on Discrete Algorithms, 2005, pp. 525-534.
39. H. Shaul, Range-searching: Emptiness, reporting and approximate counting, Ph.D. thesis, Tel-Aviv University, Tel-Aviv, Israel, 2011.