Tradeoffs in approximate range searching made simpler

Proceedings - 21st Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2008

Volumn , Issue , 2008, Pages 237-244

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

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

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DATA STRUCTURES; FUNDAMENTAL PROBLEMS; PRE-PROCESSING; PROBLEM INVOLVES; RANGE SEARCHING; SPACETIME TRADEOFFS;

COLOR IMAGE PROCESSING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DIGITAL IMAGE STORAGE; FILE ORGANIZATION; IMAGE PROCESSING; IMAGING SYSTEMS;

DATA STRUCTURES;

EID: 56749169276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIBGRAPI.2008.24     Document Type: Conference Paper

References (12)

1. P.K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, pages 1-56. AMS, 1998.
2. P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan. Geometric approximation via coresets. In J.E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, MSRI Publications. Cambridge Univ. Press, 2005.
3. S. Arya, T. Malamatos, and D.M. Mount. Space-time tradeoffs for approximate spherical range counting. In 16th Ann. ACM-SIAM Symposium on Discrete Algorithms, (SODA'05), pages 535-544, 2005.
4. S. Arya, T. Malamatos, and D.M. Mount. The effect of corners on the complexity of approximate range searching. In Proceedings of the 22nd ACM Symp. on Computational Geometry (SoCG'06), pages 11-20, 2006.
5. S. Arya, T. Malamatos, and D.M. Mount. On the importance of idempotence. In Proc. 38th ACM Symp. on Theory of Computing (STOC'06), pages 564-573, 2006.
6. S. Arya and D.M. Mount. Approximate range searching. Compta. Geom. Theory Appl., 17(3-4): 135-152, 2000.
7. S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891-923, 1998.
8. G. D. da Fonseca. Approximate Range Searching in the Absolute Error Model. PhD thesis, University of Maryland, College Park, 2007.
9. G.D. da Fonseca. Approximate range searching: The absolute model. In Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS'07), pages 2-14, 2007.
10. S. Har-Peled. Geometric approximation algorithms, http://valis.cs.uiuc. edu/~sariel/teach/notes/aprx/.
11. Q. Lv, M. Charikar, and K. Li. Image similarity search with compact data structures. In 30th ACM int. conf. on Information and knowledge management (CIKM'04), pages 208-217, New York, NY, USA, 2004. ACM.
12. J. Matoušek. Geometric range searching. ACM Computing Surveys, 26(4):421-461, 1994.