On approximate range counting and depth

Discrete and Computational Geometry

Volumn 42, Issue 1, 2009, Pages 3-21

  Afshani, Peyman ^a   Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Approximation algorithms; Data structures; Randomized algorithms; Range searching; Statistical depth

Indexed keywords

EID: 67349168125     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9177-z     Document Type: Article

References (34)

1. Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the 20th Annual Symposium on Discrete Algorithms, pp. 180-186 (2009)
2. Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 1-56. American Mathematical Society, Providence (1999)
3. Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 886-894 (2005). Updated version at http://valis.cs.uiuc.edu/ ~sariel/research/papers/04/depth/, downloaded in November 2006
4. S. Arya D.M. Mount 2000 Approximate range searching Comput. Geom. Theory Appl. 17 3-4 135 152
5. M. de Berg O. Schwarzkopf 1995 Cuttings and applications Int. J. Comput. Geom. Appl. 5 343 355 (Pubitemid 126002307)
6. Bern, M., Eppstein, D.: Multivariate regression depth. In: Proceedings of the 16th Annual Symposium on Computational Geometry, pp. 315-321 (2000) (Pubitemid 36161425)
7. Chan, T.M.: Fixed-dimensional linear programming queries made easy. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pp. 284-290 (1996)
8. T.M. Chan 1996 Output-sensitive results on convex hulls, extreme points, and related problems Discrete Comput. Geom. 16 369 387 (Pubitemid 126318137)
9. T.M. Chan 1999 Geometric applications of a randomized optimization technique Discrete Comput. Geom. 22 547 567
10. T.M. Chan 2000 Low-dimensional linear programming with violations SIAM J. Comput. 34 879 893
11. T.M. Chan 2000 Random sampling, halfspace range reporting, and construction of (a≤k)-levels in three dimensions SIAM J. Comput. 30 2 561 575
12. T.M. Chan 2001 On enumerating and selecting distances Int. J. Comput. Geom. Appl. 11 291 304 (Pubitemid 33297974)
13. Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 430-436 (2004)
14. B. Chazelle L.J. Guibas D.T. Lee 1985 The power of geometric duality BIT 25 1 76 90
15. K.L. Clarkson P.W. Shor 1989 Applications of random sampling in computational geometry, II Discrete Comput. Geom. 4 387 421
16. E. Cohen 1997 Size-estimation framework with applications to transitive closure and reachability J. Comput. Syst. Sci. 55 441 453 (Pubitemid 127432363)
17. Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol. 10. Springer, Heidelberg (1987)
18. H. Edelsbrunner E. Welzl 1986 Constructing belts in two-dimensional arrangements with applications SIAM J. Comput. 15 271 284 (Pubitemid 16477195)
19. Har-Peled, S., Sharir, M.: Relative ε-approximations in geometry. http://valis.cs.uiuc.edu/~sariel/research/papers/06/relative/ (2006). Also with B. Aronov, in Proceedings of the 23rd ACM Symposium on Computational Geometry, pp. 327-336 (2007)
20. S. Hart M. Sharir 1986 Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes Combinatorica 6 2 151 177
21. D. Haussler E. Welzl 1987 Epsilon-nets and simplex range queries Discrete Comput. Geom. 2 127 151
22. Kaplan, H., Sharir, M.: Randomized incremental constructions of three-dimensional convex hulls and planar Voronoi diagrams, and approximate range counting. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 484-493 (2006) (Pubitemid 43275270)
23. Kaplan, H., Ramos, E., Sharir, M.: Range minima queries with respect to a random permutation, and approximate range counting. Discrete Comput. Geom. (to appear)
24. Kaplan, H., Ramos, E., Sharir, M.: The overlay of minimization diagrams in a randomized incremental construction. Manuscript (2007)
25. S. Langerman W. Steiger 2003 The complexity of hyperplane depth in the plane Discrete Comput. Geom. 30 2 299 309 (Pubitemid 37089296)
26. J. Matoušek 1992 Reporting points in halfspaces Comput. Geom. Theory Appl. 2 3 169 186
27. J. Matoušek 1993 Range searching with efficient hierarchical cuttings Discrete Comput. Geom. 10 2 157 182
28. J. Matoušek 1995 On geometric optimization with few violated constraints Discrete Comput. Geom. 14 365 384
29. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
30. Mulmuley, K.: Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs (1994)
31. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
32. Ramos, E.A.: On range reporting, ray shooting and k-level construction. In: Proceedings of the 14th Annual Symposium on Computational Geometry, pp. 390-399 (1999)
33. P.J. Rousseeuw M. Hubert 1999 Regression depth J. Am. Stat. Assoc. 94 446 388 402
34. M. Sharir S. Smorodinsky G. Tardos 2001 An improved bound for k-sets in three dimensions Discrete Comput. Geom. 26 195 204 (Pubitemid 33321964)