Octree-Related Data Structures and Algorithms
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 4 (1), 53-59
- https://doi.org/10.1109/mcg.1984.275901
Abstract
The octree is not always a desirable data structure. Here, together with their formal definitions and related algorithms, are two data structures more suitable for graphics operations.Keywords
This publication has 12 references indexed in Scilit:
- A hierarchical data structure for multidimensional digital imagesCommunications of the ACM, 1983
- Geometric modeling using octree encodingComputer Graphics and Image Processing, 1982
- GMSolid: Interactive Modeling for Design and Analysis of SolidsIEEE Computer Graphics and Applications, 1982
- Solid Modeling: A Historical Summary and Contemporary AssessmentIEEE Computer Graphics and Applications, 1982
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- Oct-trees and their use in representing three-dimensional objectsComputer Graphics and Image Processing, 1980
- Picture decomposition, tree data-structures, and identifying directional symmetries as node combinationsComputer Graphics and Image Processing, 1978
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- The synthesis of solids bounded by many facesCommunications of the ACM, 1975
- The UNIX time-sharing systemCommunications of the ACM, 1974