On the importance of idempotence

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 564-573

  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

Approximation algorithms; Idempotence; Range searching

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; INTEGRAL EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; RANGE FINDING;

APPROXIMATION ALGORITHMS; ARITHMETIC MODEL; IDEMPOTENCE; RANGE SEARCHING;

COMPUTATIONAL GEOMETRY;

EID: 33748099855     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132598     Document Type: Conference Paper

References (16)

1. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1-56. American Mathematical Society, Providence, RI, 1999.
2. S. Arya and T. Malamatos. Linear-size approximate Voronoi diagrams. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, pages 147-155, 2002.
3. 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.
4. S. Arya, T. Malamatos, and D. M. Mount. Space-time tradeoffs for approximate spherical range counting. In Proc. 16th ACM-SIAM Sympos. Discrete Algorithms, pages 535-544, 2005.
5. S. Arya and D. M. Mount. Approximate range searching. Computational Geometry: Theory and Applications, 17:135-152, 2000.
6. J.-D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, UK, 1998. Translated by H. Brönnimann.
7. H. Brönnimann, B. Chazelle, and J. Pach. How hard is halfspace range searching. Discrete Comput. Geom., 10:143-155, 1993.
8. B. Chazelle. Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc., 2:637-666, 1989.
9. B. Chazelle, D. Liu, and A. Magen. Approximate range searching in higher dimension. In Proc. 16th Canad. Conf. Comput. Geom., 2004.
10. B. Chazelle, M. Sharir, and E. Welzl. Quasi-optimal upper bounds for simplex range searching and new zone theorems. Algorithmica, 8:407-429, 1992.
11. J. Erickson. Space-time tradeoffs for emptiness queries. SIAM J. Comput., 29:1968-1996, 2000.
12. M. L. Predman. Lower bounds on the complexity of some optimal data structures. SIAM J. Comput., 10:1-10, 1981.
13. S. Har-Peled. A replacement for Voronoi diagrams of near linear size. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 94-103, 2001.
14. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
15. J. Matoušek. Geometric range searching. ACM Comput. Surv., 26:421-461, 1994.
16. A. C. Yao. On the complexity of maintaining partial sums. SIAM J. Comput., 14:277-288, 1985.