The analysis of multidimensional searching in quad-trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 100-109

  Flajolet, Philippe ^a   Gonnet, Gaston ^b   Puech, Claude ^c   Robson, J M ^d  

^a INRIA ROCQUENCOURT   (France)

^b ETH ZURICH   (Switzerland)

^c ECOLE NORMALE SUPÉRIEURE   (France)

^d AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ASYMPTOTIC SOLUTIONS; GENERATING FUNCTIONS; HIERARCHICAL DATA STRUCTURE; HYPERGEOMETRIC FUNCTIONS; LINEAR DIFFERENTIAL EQUATION; MULTIDIMENSIONAL DATA; PARTIAL MATCH QUERIES; SINGULARITY ANALYSIS;

DIFFERENTIAL EQUATIONS;

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

References (25)

1. ABRAMOWITZ, M., AND STEGUN, I. A. Handbook of Mathematical Functions. Dover Publications, 1973.
2. BENTLEY, J. L. Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 9(September 1975), 509-517.
3. BENTLEY, J. L., AND FRIEDMAN, J. H. Data structures for range searching. ACM Computing Surveys 11, 4(1979), 397-409.
4. BENTLEY, J. L., AND STANAT, D. F. Analysis of range searching in quad trees. Information Processing Letters 3, 6(July 1975), 170-173.
5. BUCHTA, C. On the average number of maxima in a set of vectors. Information Processing Letters 33(November 1989), 63-65.
6. DEVROYE, L. Branching processes in the analysis of the heights of trees. Acta Informatica 24(1987), 277-298.
7. FINKEL, R. A., AND BENTLEY, J. L. Quad trees, a data structure for retrieval on composite keys. Acta Informatica 4(1974), 1-9.
8. FLAJOLET, P., AND ODLYZKO, A. M. Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3, 2(1990), 216-240.
9. FLAJOLET, P., AND PUECH, C. Partial match retrieval of multidimensional data. Journal of the ACM 33, 2(1986), 371-407.
10. GONNET, G. H. Handbook of Algorithms and Data Structures. Addison-Wesley, 1984.
11. GUIBAS ED., L. Problems. Journal of Algorithms 3, 4(1982), 362-380. (Problem 80-6), from the Stanford 1979 Algorithms Qualifying Examination. Solution by Eric S. Rosenthal, pp. 368-371.
12. HENRICI, P. Applied and Computational Complex Analysis, vol. 2. John Wiley, New York, 1977.
13. IYENGAR, S. S., RAO, N. S. V., KASHYAP, R. L., AND VAISHNAVI, V. K. Multidimensional data structures: Review and outlook. Advances in Computers 27(1988), 69-119.
14. KNUTH, D. E. The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
15. MATHIEU, C, PUECH, C, AND YAHIA, H. Average efficiency of data structures for binary image processing. Information Processing Letters 26(October 1987), 89-93.
16. PREPARATA, F. P., AND SHAMOS, M. I. Computational Geometry, An Introduction. Springer Verlag, 1985.
17. PUECH, C. Méthodes d'analyse de structures de données dynamiques. Doctorat ès sciences, Université de Paris Sud, Orsay, 1984.
18. PUECH, C, AND YAHIA, H. Quadtrees, octrees, hyperoctrees: a unfied approach to tree data structures used in graphics, geometric modeling and image processing. In First ACM Symposium on Computational Geometry (Baltimore, 1985), pp. 272-280.
19. RÉGNIER, M. Analysis of grid file algorithms. BIT 25(1985), 335-357.
20. SAMET, H. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
21. SEDGEWICK, R. Algorithms, second ed. Addison-Wesley, Reading, Mass., 1988.
22. WASOW, W. Asymptotic Expansions for Ordinary Differential Equations. Dover Publications, 1987.
23. WHITTAKER, E. T., AND WATSON, G. N. A Course of Modern Analysis, fourth ed. Cambridge University Press, 1927. Reprinted 1973.
24. WIMP, J., AND ZEILBERGER, D. Resurrecting the asymptotics of linear recurrences. Journal of Mathematical Analysis and Applications 111(1985), 162-176.
25. YAHIA, H. Analyse des structures de données arborescentes représentant des images. Doctorat de troisième cycle, Université de Paris Sud, Orsay, December 1986.