Efficient octree conversion by connectivity labeling
- 1 January 1984
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 18 (3), 43-51
- https://doi.org/10.1145/800031.808576
Abstract
We present an algorithm for converting from the boundary representation of a solid to the corresponding octree model. The algorithm utilizes an efficient new connected components labeling technique. A novelty of the method is the demonstration that all processing can be performed directly on linear quad and octree encodings. We illustrate the use of the algorithm by an application to geometric mine modeling and verify its performance by analysis and practical experiments.Keywords
This publication has 11 references indexed in Scilit:
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- Solid Modeling: Current Status and Research DirectionsIEEE Computer Graphics and Applications, 1983
- A hierarchical data structure for multidimensional digital imagesCommunications of the ACM, 1983
- Localized set operations for solid modelingACM SIGGRAPH Computer Graphics, 1983
- Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximationCommunications of the ACM, 1982
- Representation of Three-Dimensional Digital ImagesACM Computing Surveys, 1981
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- Region representationCommunications of the ACM, 1980
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975