Efficient octree conversion by connectivity labeling

Authors:
Markku Tamminen;Hanan Samet
Affiliations:
Laboratory of Information Processing Science, Helsinki University of Technology, 02150 Espoo 15, Finland;Computer Science Department, University of Maryland, College Park, MD
Venue:
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Year:
1984

Citing 10
Cited 13

Algorithms

Algorithms
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Connected Component Labeling Using Quadtrees

Journal of the ACM (JACM)
Representations for Rigid Solids: Theory, Methods, and Systems

ACM Computing Surveys (CSUR)
Representation of Three-Dimensional Digital Images

ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
A hierarchical data structure for multidimensional digital images

Communications of the ACM
Algorithms for computing the volume and other integral properties of solids. II. A family of algorithms based on representation conversion and cellular approximation

Communications of the ACM
Region representation: quadtrees from boundary codes

Communications of the ACM
Localized set operations for solid modeling

SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques

Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees

IEEE Transactions on Pattern Analysis and Machine Intelligence
Three-dimensional medical imaging: algorithms and computer systems

ACM Computing Surveys (CSUR)
Octrees for faster isosurface generation

ACM Transactions on Graphics (TOG)
Bintrees, CSG trees, and time

SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys (CSUR)
Painting and rendering textures on unparameterized models

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Octree textures

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Adaptive Projection Operators in Multiresolution Scientific Visualization

IEEE Transactions on Visualization and Computer Graphics
Adaptive Projection Operators in Multiresolution Scientific Visualization

IEEE Transactions on Visualization and Computer Graphics
Hierarchical Data Structures and Algorithms for Computer Graphics

IEEE Computer Graphics and Applications
Linear-time connected-component labeling based on sequential local operations

Computer Vision and Image Understanding
Fast connected-component labeling

Pattern Recognition
Multidimensional data structures for spatial applications

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

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.