Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Geometric and solid modeling: an introduction
Geometric and solid modeling: an introduction
Boundary and object labelling in three-dimensional images
Computer Vision, Graphics, and Image Processing
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
CVGIP: Graphical Models and Image Processing
A systolic approach for real time connected component labeling
Computer Vision and Image Understanding
A boundary approach for fast neighborhood operations on three-dimensional binary data
Graphical Models and Image Processing
Graphical Models and Image Processing
Orthogonal polyhedra as geometric bounds in constructive solid geometry
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
Converting Discrete Images to Partitioning Trees
IEEE Transactions on Visualization and Computer Graphics
Fast Visualization, Manipulation, and Analysis of Binary Volumetric Objects
IEEE Computer Graphics and Applications
Erosion and Dilation on 2-D and 3-D Digital Images: A New Size-Independent Approach
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
| Hi-index | 0.00 |
This paper presents a new approach to achieve connected component labeling on both binary images and volumes by using the Extreme Vertices Model (EVM), a representation model for orthogonal polyhedra, applied to digital images and volume datasets recently. In contrast with previous techniques, this method does not use a voxel-based approach but deals with the inner sections of the object. This approach allows us to build data size-independent algorithms and work with volumes from range data or solid modeling field indistinctly. Our proposal, also can be applied to manifold as well as non-manifold data. The algorithm actually detects non-manifold zones and permits to break or not the objects at these zones by an user-specified parameter.