Space-time tradeoffs for approximate spherical range counting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 535-544

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

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

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c University of Maryland   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE VORONOI DIAGRAMS (AVD); QUERY TIME; SPACE-TIME TRADEOFFS; SPHERICAL RANGE COUNTING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COUNTING CIRCUITS; DATA REDUCTION; DATA STRUCTURES; ONLINE SEARCHING; SET THEORY; TREES (MATHEMATICS);

QUERY LANGUAGES;

EID: 20744446135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Arya and T. Malamatos. Linear-size approximate Voronoi diagrams. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 147-155, 2002.
2. S. Arya, T. Malamatos, and D. M. Mount. Space-efficient approximate Voronoi diagrams. In Proc. 34th Annual ACM Sympos. Theory Comput., pages 721-730, 2002.
3. S. Arya and D. M. Mount. Approximate range searching. Computational Geometry: Theory and Applications, 17:135-152, 2000.
4. S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573-582, 1994.
5. S. Arya, D. M. Mount, N. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45:891-923, 1998.
6. H. Brönnimann, B. Chazelle, and J. Pach. How hard is halfspace range searching. Discrete Comput. Geom., 10:143-155, 1993.
7. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42:67-90, 1995.
8. B. Chazelle. Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc., 2:637-666, 1989.
9. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
10. M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
11. S. Funke and E. A. Ramos. Smooth-surface reconstruction in near-linear time. In Proc. 12th ACM-SIAM Symp. Discrete Algorithms, pages 781-790, 2002.
12. S. Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proc. 42 Annu. IEEE Sympos. Found. Comput. Sci., pages 94-103, 2001.
13. J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Comput. Geom. Theory Appl., 12:219-239, 1999.
14. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
15. J. Matoušek. On approximate geometric k-clustering. Discrete and Comput. Geometry, 24:61-84, 2000.
16. J. Matoušek and O. Schwarzkopf. On ray shooting in convex polytopes. Discrete Comput. Geom., 10(2):215-232, 1993.
17. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.