Approximate halfspace range counting

SIAM Journal on Computing

Volumn 39, Issue 7, 2010, Pages 2704-2725

  Aronov, Boris ^a   Sharir, Micha ^b,c  

^a POLYTECHNIC UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Cuttings; Geometric algorithms; Geometric sampling; Hyperplane arrangements; Partition trees; Range counting; Range searching; Relative approximations; Shallow cuttings; Shallow partition trees

Indexed keywords

GEOMETRIC ALGORITHM; GEOMETRIC SAMPLING; HYPERPLANE ARRANGEMENTS; PARTITION TREES; RANGE COUNTING; RANGE SEARCHING; RELATIVE APPROXIMATIONS; SHALLOW CUTTINGS; SHALLOW PARTITION TREES;

DATA STRUCTURES; GEOMETRY; QUERY PROCESSING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77956022804     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080736600     Document Type: Article

References (32)

1. P. AFSHANI AND T. M. CHAN, On approximate range counting and depth, Discrete Comput. Geom., 41 (2009), pp. 3-21.
2. P. K. AGARWAL AND J. ERICKSON, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, American Mathematical Society, Providence, RI, 1999, pp. 1-56.
3. N. ALON AND J. SPENCER, The Probabilistic Method, Wiley-Interscience, New York, 1992.
4. B. ARONOV AND S. HAR-PELED, On approximating the depth and related problems, SIAM J. Comput., 38 (2008), pp. 899-921.
5. B. ARONOV, S. HAR-PELED, AND M. SHARIR, On approximate halfspace range counting and relative epsilon approximations, in Proceedings of the 23rd Annual ACM Symposium on Computational Geometry, Gyeongju, South Korea, 2007, ACM, New York, pp. 327-336.
6. S. ARYA, G. D. DA FONSECA, AND D. MOUNT, Trade-offs in approximate range searching made simpler, in Proceedings of the 21st Brazilian Symposium on Computer Graphics and Image Processing, 2008, pp. 237-243.
7. S. ARYA, T. MALAMATOS, AND D. MOUNT, Space-time tradeoffs for approximate spherical range counting, in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, BC, 2005, SIAM, Philadelphia, pp. 535-544;
8. full version available as Department of Computer Science Technical Report CS-TR-4842, University of Maryland, College Park, MD, 2006, pp. 535-544.
9. S. ARYA, T. MALAMATOS, AND D. MOUNT, The effect of corners on the complexity of approximate range searching, Discrete Comput. Geom., 41 (2009), pp. 398-443.
10. H. BRÖNNIMANN, B. CHAZELLE, AND J. MATOUŠEK, Product range spaces, sensitive sampling, and derandomization, SIAM J. Comput., 28 (1999), pp. 1552-1575.
11. B. CHAZELLE, The Discrepancy Method, Cambridge University Press, Cambridge, UK, 2001.
12. B. CHAZELLE, The discrepancy method in computational geometry, in Handbook of Discrete and Computational Geometry, 2nd ed., J. E. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 2004, pp. 983-996.
13. B. CHAZELLE, D. LIU, AND A. MAGEN, Approximate range searching in higher dimension, Comput. Geom. Theory Appl., 39 (2008), pp. 24-29.
14. E. COHEN, Size-estimation framework with applications to transitive closure and reachability, J. Comput. System Sci., 55 (1997), pp. 441-453.
15. E. COHEN, H. KAPLAN, Y. MANSOUR, AND M. SHARIR, Approximations with Relative Errors in Range Spaces of Finite VC Dimension, manuscript, School of Computer Science, Tel Aviv University, 2006.
16. G. D. DA FONSECA, Approximate range searching: The absolute model, in Proceedings of the Workshop on Algorithms and Data Structures, Halifax, 2007, Lecture Notes in Comput. Sci. 4619, Springer, New York, 2007, pp. 2-14.
17. S. HAR-PELED, Carnival of Samplings: Nets, Approximations, Relative, and Sensitive, manuscript, Department of Computer Science, University of Illinois at Urbana - Champagne, 2008; available online at http://arxiv.org/abs/0908.3716vl.
18. S. HAR-PELED AND M. SHARIR, Relative (p,ε)-approximations in geometry, Discrete Comput. Geom., to appear; http://arxiv.org/abs/0909.0717.
19. D. HAUSSLER, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Inform, and Comput., 100 (1992), pp. 78-150.
20. D. HAUSSLER AND E. WELZL, Epsilon nets and simplex range queries, Discrete Comput. Geom., 2 (1987), pp. 127-151.
21. H. KAPLAN, E. RAMOS, AND M. SHARIR, Range minima queries with respect to a random permutation, and approximate range counting, Discrete Comput. Geom., to appear.
22. H. KAPLAN AND M. SHARIR, Randomized incremental construction of three-dimensional convex hulls and planar Voronoi diagrams, and approximate range counting, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, 2006, SIAM, Philadelphia, 2006, pp. 484-493.
23. 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.
24. J. MATOUŠEK, Reporting points in halfspaces, Comput. Geom. Theory Appl., 2 (1992), pp. 169-186.
25. J. MATOUŠEK, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
26. J. MATOUŠEK, Geometric Discrepancy: An Illustrated Guide, Algorithms Combin. 18, Springer-Verlag, Berlin, 1999.
27. J. MATOUŠEK, E. WELZL, AND L. WERNISCH, Discrepancy and approximations for bounded VC-dimension, Combinatorica, 13 (1993), pp. 455-466.
28. J. PACH AND P. K. AGARWAL, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
29. D. POLLARD, Rates of Uniform Almost-Sure Convergence for Empirical Processes Indexed by Unbounded Classes of Functions, manuscript, 1986.
30. M. SHARIR AND H. SHAUL, Semi-algebraic range reporting and emptiness searching with applications, SIAM J. Comput., submitted; http://arxiv.org/abs/ 0908.4061v2.
31. M. TALAGRAND, Sharper bounds for Gaussian and empirical processes, Ann. Probab., 22 (1994), pp. 28-76.
32. V. N. VAPNIK AND A. YA. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1971), pp. 264-280.