论文信息 - A formula for computing the number of quadtree node fragments created by a shift

A formula for computing the number of quadtree node fragments created by a shift

A formula is provided to compute the number of new blocks resulting from the decomposition induced by a shift of a single quadtree node of arbitrary size by an arbitrary amount. A precise calculation is also presented for the average number of BLACK nodes required to represent a square of width 2 m in a region quadtree.

Clifford A. Shaffer | C. Shaffer

[1] Charles R. Dyer,et al. The space efficiency of quadtrees , 1982, Comput. Graph. Image Process..

[2] Ming Li,et al. Normalized quadtrees with respect to translations , 1982, Comput. Graph. Image Process..

[3] Azriel Rosenfeld,et al. Application of Hierarchical Data Structures to Geographical Information Systems. , 1983 .

[4] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.