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 2d 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. © 1983, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Yau, M. M., & Srihari, S. N. (1983). A Hierarchical Data Structure for Multidimensional Digital Images. Communications of the ACM, 26(7), 504–515. https://doi.org/10.1145/358150.358158
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.