Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Journal of Algorithms
Updating the Hamiltonian problem—a survey
Journal of Graph Theory
4-connected projective-planar graphs are Hamiltonian
Journal of Combinatorial Theory Series B
Geometric modeling of solid objects by using a face adjacency graph representation
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Introduction to algorithms
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Boundary detection in 3-dimensions with a medical application
ACM SIGGRAPH Computer Graphics
An easy measure of compactness for 2D and 3D shapes
Pattern Recognition
A method for representing 3D tree objects using chain coding
Journal of Visual Communication and Image Representation
3D-curve representation by means of a binary chain code
Mathematical and Computer Modelling: An International Journal
IEEE Transactions on Image Processing
| Hi-index | 0.01 |
A chain code for representing three-dimensional (3D) simple objects is defined. Once digitalized, any solid composed of voxels and homeomorphic to the sphere can be described by means of a codified sequence of faces in the enclosing surface. This sequence is obtained from a Hamiltonian cycle in the face adjacency graph of such a surface. For the proposed code each chain element takes one of nine possible values and the length of a chain is determined by the number of faces in the surface. Since this code only considers relative changes of direction, the descriptor is invariant under rotation and translation. We also show some simple operations over the chain to make this descriptor invariant under mirroring and complement transformations. Finally, we present some results of this code applied to large objects and demonstrate its convenience over other codes. Part of the relevance of this work is the lossless compact representation of 3D objects by using a single chain regardless of its position and orientation.