Virtual voyage: interactive navigation in the human colon
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Reliable Path for Virtual Endoscopy: Ensuring Complete Examination of Human Organs
IEEE Transactions on Visualization and Computer Graphics
Directional 3D Thinning Using 8 Subiterations
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Graphical Models - Volume modeling
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Skeleton Based Shape Matching and Retrieval
SMI '03 Proceedings of the Shape Modeling International 2003
Fundamentals of Information Theory and Coding Design
Fundamentals of Information Theory and Coding Design
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations
IEEE Transactions on Visualization and Computer Graphics
Graph Theory With Applications
Graph Theory With Applications
Domain connected graph: the skeleton of a closed 3D shape for animation
The Visual Computer: International Journal of Computer Graphics
A chaincode based scheme for fingerprint feature extraction
Pattern Recognition Letters
Digital Terrain Modelling: Development and Applications in a Policy Support Environment (Lecture Notes in Geoinformation and Cartography)
Lossless compression of map contours by context tree modeling of chain codes
Pattern Recognition
Efficiency of chain codes to represent binary objects
Pattern Recognition
Generating realistic terrains with higher-order Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
Computing a family of skeletons of volumetric models for shape description
Computer-Aided Design
Curve-Skeleton Properties, Applications, and Algorithms
IEEE Transactions on Visualization and Computer Graphics
Pattern Recognition
A method for representing 3D tree objects using chain coding
Journal of Visual Communication and Image Representation
Skeleton extraction by mesh contraction
ACM SIGGRAPH 2008 papers
Curve-Skeleton Extraction Using Iterative Least Squares Optimization
IEEE Transactions on Visualization and Computer Graphics
Size functions for comparing 3D models
Pattern Recognition
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
A 3D 6-subiteration curve thinning algorithm based on P-simple points
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A proposal modification of the 3OT chain code
CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
Contour-Shape Recognition and Retrieval Based on Chain Code
CIS '09 Proceedings of the 2009 International Conference on Computational Intelligence and Security - Volume 01
An efficient chain code with Huffman coding
Pattern Recognition
Proposing a new code by considering pieces of discrete straight lines in contour shapes
Journal of Visual Communication and Image Representation
On the computation of the {3, 4, 5} curve skeleton of 3D objects
Pattern Recognition Letters
Graph-based representations of point clouds
Graphical Models
Three-Dimensional Digital Line Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
A proposal method for corner detection with an orthogonal three-direction chain code
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Robust curve skeleton extraction for vascular structures
Graphical Models
Context-based coding of bilevel images enhanced by digital straight line analysis
IEEE Transactions on Image Processing
Hi-index | 0.01 |
A new chain code to represent 3D discrete curves is proposed. The method is based on a search for relative changes in the 3D Euclidean space, composed of three main vectors: a reference vector, a support vector, and a change direction vector, utilized to obtain a directed simple path in a grid of 26 connected components. A set of rotation transformations is defined in the 3D Euclidean space, and an alphabet of only 25 symbols is required to represent any face, edge or vertex-connected discrete curve. Important properties of this code are found: independence under translation, rotation and mirror transformations, as well as high compression levels. A set of 3D curve-skeletons and digital elevation model data to study the terrain were utilized to prove the proposed code. Compared with the state-of-the-art, our method has more advantages: at first, it represents voxelized paths independently of vicinity, also it gives better representation for the tested objects and detects better the redundant parts. This fact is shown in the entropy calculated for 3D curve-skeletons: our method gives 3.03bits/symbol, whereas the state-of-the-art method gives 4.35bits/symbol. On the other hand, our proposed chain code uses 23% less memory than the well known Freeman code of 26 directions. In case of digital elevation models, our method improves memory for 36.1% regarding Freeman code and 10.7% regarding the well known relative code called orthogonal direction change chain code. Finally, average length of the chain code proposed is 14% shorter than the relative code of the state-of-the-art.