A new relative chain code in 3D
DOI10.1016/J.PATCOG.2013.08.010zbMATH Open1326.68313OpenAlexW2080593108MaRDI QIDQ898331FDOQ898331
Hermilo Sánchez-Cruz, Hiram H. López, Francisco J. Cuevas
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.08.010
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating realistic terrains with higher-order Delaunay triangulations
- Compressed piecewise-circular approximations of 3D curves
- Size functions for comparing 3D models
- Lossless compression of map contours by context tree modeling of chain codes
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- Fast template matching algorithm for contour images based on its chain coded description applied for human face identification
- Efficiency of chain codes to represent binary objects
- Automated generation of control skeletons for use in animation
- The complexity of flow on fat terrains and its i/o-efficient computation
- Compressed vertex chain codes
- Three-Dimensional Digital Line Segments
- Title not available (Why is that?)
- Animating Volumetric Models
Cited In (7)
- 3D-curve representation by means of a binary chain code
- Classification and generation of 3D discrete curves
- A formal language approach for a 3D curve representation.
- Efficient chain code compression with interpolative coding
- A Study on the Properties of 3D Digital Straight Line Segments
- Symmetry detection in 3D chain coded discrete curves and trees
- Compressed vertex chain codes
This page was built for publication: A new relative chain code in 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898331)