Biased range trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 486-495

  Dujmović, Vida ^a   Howat, John ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

CONSTANT FACTORS; QUERY DISTRIBUTIONS; QUERY TIME;

TREES (MATHEMATICS);

EID: 70349153451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.54     Document Type: Conference Paper

References (15)

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 Press, 1999.
2. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18:509-517, 1975.
3. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23:214-229, 1980. (Pubitemid 11425786)
4. B. Chazelle. Filtering search: A new approach to query-answering. SIAM Journal on Computing, 15:703-724, 1986. (Pubitemid 16634090)
5. B. Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17:427-462, 1988.
6. B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1:133-162, 1986.
7. S. Collette, V. Dujmović, J. Iacono, S. Langerman, and P. Morin. Distribution-sensitive point location in convex subdivisions. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), 2008. Submitted to SIAM Journal on Computing, August 2007.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, 1997.
9. M. L. Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28:696-705, 1981.
10. G. S. Luecker. A data structure for orthogonal range queries. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 28-34, 1978.
11. K. Mehlhorn. Nearly optimal binary search trees. Acta Informatica, 5:287-295, 1975.
12. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
13. R. Seidel and U. Adamy. On the exact worst case query complexity of planar point location. Journal of Algorithms, 37(1):189-217, 2000.
14. C. E. Shannon. A mathematical theory of communication. Bell Systems Technical Journal, pages 379-423 and 623-656, 1948.
15. A. C. Yao. On the complexity of maintaining partial sums. SIAM Journal on Computing, 14:277-288, 1985.