The effect of corners on the complexity of approximate range searching

Discrete and Computational Geometry

Volumn 41, Issue 3, 2009, Pages 398-443

  Arya, Sunil ^a   Malamatos, Theocharis ^b   Mount, David M ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF PELOPONNESE   (Greece)

^c Institute of Advanced Computer Science   (United States)

Author keywords

Approximation algorithms; Computational complexity; Idempotence; Range searching

Indexed keywords

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

References (23)

1. 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)
2. S. Arya D.M. Mount 2000 Approximate range searching Comput. Geom. Theory Appl. 17 135 152
3. Arya, S., Malamatos, T.: Linear-size approximate Voronoi diagrams. In: Proc. 13th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 147-155 (2002)
4. Arya, S., Malamatos, T., Mount, D.M.: Space-efficient approximate Voronoi diagrams. In: Proc. 34th Annu. ACM Sympos. Theory Comput., pp. 721-730 (2002)
5. Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. In: Proc. 16th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 535-544 (2005)
6. Arya, S., Malamatos, T., Mount, D.M.: On the importance of idempotence. In: Proc. 38th Annu. ACM Sympos. Theory Comput., pp. 564-573 (2006)
7. Arya, S., Malamatos, T., Mount, D.M.: Space-time tradeoffs for approximate spherical range counting. Technical Report CS-TR-4842, Dept. of Computer Science, University of Maryland (2006)
8. Arya, S., da Fonseca, G.D., Mount, D.M.: Tradeoffs in approximate range searching made simpler. In: SIBGRAPI '08: Proceedings of the 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing, pp. 237-244. IEEE Computer Society, Los Alamitos (2008)
9. I. Bárány 1989 Intrinsic volumes and f-vectors of random polytopes Math. Ann. 285 671 699
10. Bárány, I.: The technique of M-regions and cap-coverings: A survey. In: Proc. III International Conference in Stochastic Geometry, Convex Bodies and Empirical Measures, Part II, Rendi. del Circ. Matemat. di Palermo, vol. 65, pp. 21-38 (2000)
11. I. Bárány D. Larman 1988 Convex bodies, economic cap coverings, random polytopes Mathematika 35 274 291
12. H. Brönnimann B. Chazelle J. Pach 1993 How hard is halfspace range searching? Discrete Comput. Geom. 10 143 155
13. Chan, T.M., Snoeyink, J.: Algorithms for approximate nearest-neighbor queries. Manuscript (1995)
14. B. Chazelle 1989 Lower bounds on the complexity of polytope range searching J. Am. Math. Soc. 2 637 666
15. B. Chazelle D. Liu A. Magen 2008 Approximate range searching in higher dimension Comput. Geom. Theory Appl. 39 24 29
16. da Fonseca, G.D.: Approximate range searching: The absolute model. In: Proc. 10th Workshop Algorithms Data Struct., pp. 2-14 (2007)
17. J. Erickson 2000 Space-time tradeoffs for emptiness queries SIAM J. Comput. 29 1968 1996
18. G. Ewald D.G. Larman C.A. Rogers 1970 The directions of the line segments and of the r-dimensional balls on the boundary of a convex body in Euclidean space Mathematika 17 1 20
19. M.L. Fredman 1981 Lower bounds on the complexity of some optimal data structures SIAM J. Comput. 10 1 10
20. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, vol. 2. Springer, Berlin (1988). 2nd edn. 1994
21. J. Matoušek 1993 Range searching with efficient hierarchical cuttings Discrete Comput. Geom. 10 2 157 182
22. J. Matoušek 1994 Geometric range searching ACM Comput. Surv. 26 421 461
23. A.C. Yao 1985 On the complexity of maintaining partial sums SIAM J. Comput. 14 277 288