On the size of quadtrees generalized to d-dimensional binary pictures

T.R. Walsh
1985 Computers and Mathematics with Applications  
S~meresu~tsaboutthesize~fquadtreesand~inearq~dtrees'usedt~r~pres~ntbinary2 ~ x 2" digital pictures, are generalized to d-dimensional 2" x . . . x 2" pictures. Among these results are a comparison of the space-efficiency of linear vs regular trees, in terms of both the number of nodes of the tree and the number of bits needed to store each node, and an upper bound on the number of nodes as a function of n and the perimeter of the picture.
doi:10.1016/0898-1221(85)90187-7 fatcat:vkmjwi6ry5dzbc3unjhlfdmboa