Node distribution in a PR quadtree
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 phrasesPR quadtrees population analysis hierarchical data structures
Unable to display preview. Download preview PDF.
- [Fell57]— W. Feller, An Introduction to Probability Theory and its Applications, Volume 1, second edition, John Wiley, New York, 1957.Google Scholar
- [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
- [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
- [Sant76]— L.A. Santalo, Integral Geometry and Geometric Probability,, Addison-Wesley, Reading, MA, 1976, Chapters 1–3.Google Scholar