A hierarchical data structure for multidimensional digital images
- 1 July 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (7), 504-515
- https://doi.org/10.1145/358150.358158
Abstract
A tree data structure for representing multidimensional digital binary images is described. The method is based on recursive subdivision of the d-dimensional space into 2 d hyperoctants. An algorithm for constructing the tree of a d-dimensional binary image from the trees of its (d - 1 )-dimensional cross sections is given. The computational advantages of the data structure and the algorithm are demonstrated both theoretically and in application to a three-dimensional reconstruction of a human brain.Keywords
This publication has 8 references indexed in Scilit:
- Representation of Three-Dimensional Digital ImagesACM Computing Surveys, 1981
- MATHEMATICAL ASPECTS OF IMAGE RECONSTRUCTION FROM PROJECTIONSPublished by Elsevier BV ,1981
- Automatic Planning of Manipulator Transfer MovementsIEEE Transactions on Systems, Man, and Cybernetics, 1981
- Oct-trees and their use in representing three-dimensional objectsComputer Graphics and Image Processing, 1980
- Region representation: Quadtrees from binary arraysComputer Graphics and Image Processing, 1980
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- A hierarchical data structure for picture processingComputer Graphics and Image Processing, 1975
- Representations for space planningCommunications of the ACM, 1970