Approximate range searching: The absolute model

Computational Geometry: Theory and Applications

Volumn 43, Issue 4, 2010, Pages 434-444

  Da Fonseca, Guilherme D ^a   Mount, David M ^a,b  

^a University of Maryland ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Absolute model; Approximation; Halfbox quadtree; Idempotence; Range searching

Indexed keywords

EID: 73549116088     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.09.009     Document Type: Article

References (27)

1. P. Afshani, and T.M. Chan On approximate range counting and depth Discrete Comput. Geom. 42 2009 3 21
2. P.K. Agarwal, and J. Erickson Geometric range searching its relatives B. Chazelle J. Goodman R. Pollack Advances in Discrete and Computational Geometry 1998 American Mathematical Society 1 56
3. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan Geometric approximation via coresets J.E. Goodman J. Pach E. Welzl Combinatorial and Computational Geometry 2005 MSRI Publications, Cambridge University Press
4. B. Aronov, S. Har-Peled, M. Sharir, On approximate halfspace range counting and relative epsilon-approximations, in: Proc. 23rd ACM Symp. on Computational Geometry, SoCG'07, 2007, pp. 327-336
5. S. Arya, T. Malamatos, D.M. Mount, Space-time tradeoffs for approximate spherical range counting, in: 16th Ann. ACM-SIAM Symposium on Discrete Algorithms, SODA'05, 2005, pp. 535-544
6. S. Arya, T. Malamatos, and D.M. Mount The effect of corners on the complexity of approximate range searching Discrete Comput. Geom. 41 2009 398 443
7. S. Arya, T. Malamatos, D.M. Mount, On the importance of idempotence, in: Proc. 38th ACM Symp. on Theory of Computing, STOC'06, 2006, pp. 564-573
8. S. Arya, and D.M. Mount Approximate range searching Comput. Geom. Theory Appl. 17 3-4 2000 135 152
9. B. Babcock, S. Babu, M. Data, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proc. ACM Princ. Database Systems, 2002, pp. 1-16
10. H. Brönnimann, B. Chazelle, and J. Pach How hard is half-space range searching Discrete Comput. Geom. 10 1993 143 155
11. T.M. Chan Faster core-set constructions data-stream algorithms in fixed dimensions Comput. Geom. Theory Appl. 35 1 2006 20 35
12. B. Chazelle Lower bounds on the complexity of polytope range searching J. Amer. Math. Soc. 2 1989 637 666
13. B. Chazelle Lower bounds for orthogonal range searching: part II. The arithmetic model J. ACM 37 3 1990 439 463 (Pubitemid 20723064)
14. B. Chazelle The Discrepancy Method: Randomness and Complexity 2000 Cambridge University Press New York, NY, USA
15. B. Chazelle, D. Liu, and A. Magen Approximate range searching in higher dimension Comput. Geom. Theory Appl. 39 1 2008 24 29
16. B. Chazelle, and J. Matouek On linear-time deterministic algorithms for optimization problems in fixed dimension J. Algorithms 21 3 1996 579 597
17. B. Chazelle, B. Rosenberg, Computing partial sums in multidimensional arrays, in: Proc. 5th ACM Symp. Comput. Geom., SoCG'89, 1989, pp. 131-139
18. G.D. da Fonseca, Approximate range searching in the absolute error model, PhD thesis, University of Maryland, College Park, 2007
19. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwartzkopf Computational Geometry: Algorithms and Applications 2000 Springer
20. J. Matouek Reporting points in halfspaces Comput. Geom. Theory Appl. 2 3 1992 169 186
21. J. Matouek Range searching with efficient hierarchical cuttings Discrete Comput. Geom. 10 1993 157 182
22. J. Matouek Geometric range searching ACM Comput. Surv. 26 4 1994 421 461
23. S. Muthukrishnan Data Streams: Algorithms and Applications 2005 Now Publishers
24. M.H. Overmars, and A.F. van der Stappen Range searching point location among fat objects J. Algorithms 21 3 1996 629 656
25. S. Suri, C.D. Tóth, and Y. Zhou Range counting over multidimensional data streams Discrete Comput. Geom. 36 4 2006 633 655
26. R.E. Tarjan Efficiency of a good but not linear set union algorithm J. ACM 22 2 1975 215 225
27. A.C. Yao, Space-time tradeoff for answering range queries, in: Proc. 14th ACM Symp. on Theory of Computing, STOC'82, 1982, pp. 128-136