Efficient Storage of Quadtrees and Octrees
We study a method of representing space efficiently quadtrees, octrees and related pixel trees. Its efficiency of encoding two-dimensional black-and-white and multicolour images is compared to that of established methods such as chain encoding. For both two- and three-dimensional images we show that beside quad- and octrees it is relevant to consider also pixel trees based on a binary division of space. A paged storage scheme is proposed for accessing encoded pixel trees by spatial location.
KeywordsBinary Tree Efficient Storage Change Code Boundary Pixel Chain Code
Unable to display preview. Download preview PDF.
- 1.N. Ahuja and B. Schachter, Image models. Comp. Surv. 13 (1981) 4.Google Scholar
- 2.A. Blaser (ed.), Data base techniques for pictorial applications, Springer Verlag, Lecture Notes in Computer Science, 1980Google Scholar
- 6.R. Hunter and A.H. Robinson, International digital faximile coding standards, in 8Google Scholar
- 7.G.M. Hunter and G. Steiglitz, operations on images using quadtrees, IEEE PAMI-1, 1979Google Scholar
- 12.M. Kunt and O. Johnsen, Block coding of graphics: a tutorial review, in 8, 770–786Google Scholar
- 14.R.E. Miles A survey of geometrical probability in the plane, Computer Graphics and Image Processing, 12, 1980Google Scholar
- 20.M. Tamminen, Performance analysis of cell based file structures, to appear in Computer Graphics and Image ProcessingGoogle Scholar
- 21.M. Tamminen, Efficient geometric access to a multirepresentation geo-database, submitted for publication. (Also Report-HTKK-TKOB52, Helsinki University of Technology, Espoo, 1983.)Google Scholar
- 22.M. Tamminen, Encoding pixel trees, submitted for publication. (Also Report-HTKK-TKO-B51, Helsinki University of Technology, Espoo, 1983.)Google Scholar