Node distribution in a PR quadtree

  • Chuan-Heng Ang
  • Hanan Samet
Part of the Lecture Notes in Computer Science book series (LNCS, volume 409)


A method, termed approximate splitting, is proposed to model the node distribution that results when the PR quadtree is used to store point data drawn from a uniform distribution. This method can account for the aging and phasing phenomena which are common in most hierarchical data structures. Approximate splitting is also shown to be capable of being adapted to model the node distribution of the PR quadtree with points drawn from a known non-uniform distribution.

Keywords and phrases

PR quadtrees population analysis hierarchical data structures 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. [Dyer82]
    — C.R. Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing 19, 4(August 1982), 335–348.CrossRefGoogle Scholar
  2. [Fell57]
    — W. Feller, An Introduction to Probability Theory and its Applications, Volume 1, second edition, John Wiley, New York, 1957.Google Scholar
  3. [Garg82]
    — I. Gargantini, An effective way to represent quadtrees, Communications of the ACM 25, 12(December 1982), 905–910.CrossRefGoogle Scholar
  4. [Klin71]
    — A. Klinger, Patterns and Search Statistics, in Optimizing Methods in Statistics, J.S. Rustagi, Ed., Academic Press, New York, 1971, 303–337.Google Scholar
  5. [Nels86]
    — R.C. Nelson and H. Samet, A population analysis of quadtrees with variable node size, Computer Science TR-1740, University of Maryland, College Park, MD, December 1986.Google Scholar
  6. [Same84a]
    — H. Samet, The quadtree and related hierarchical data structures, ACM Computing Surveys 16, 2(June 1984), 187–260.CrossRefGoogle Scholar
  7. [Same84b]
    — H. Samet, A. Rosenfeld, C.A. Shaffer, and R.E. Webber, A geographic information system using quadtrees, Pattern Recognition 17, 6(1984), 647–656.CrossRefGoogle Scholar
  8. [Same85]
    — H. Samet and R.E. Webber, Storing a collection of polygons using quadtrees, ACM Transactions on Graphics 4, 3(July 1985), 182–222.CrossRefGoogle Scholar
  9. [Sant76]
    — L.A. Santalo, Integral Geometry and Geometric Probability,, Addison-Wesley, Reading, MA, 1976, Chapters 1–3.Google Scholar
  10. [Shaf88]
    — C.A. Shaffer, A formula for computing the number of quadtree node fragments created by a shift, Pattern recognition letters 7, 1(January 1988), 45–49.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Chuan-Heng Ang
    • 1
  • Hanan Samet
    • 1
  1. 1.Computer Science Department Institute of Advance Computer Studies and Center for Automation ResearchUniversity of MarylandCollege Park

Personalised recommendations