Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
On topology preservation in 3D thinning
CVGIP: Image Understanding
Simple points, topological numbers and geodesic neighborhoods in cubic grids
Pattern Recognition Letters
A 3D fully parallel thinning algorithm for generating medial faces
Pattern Recognition Letters
A fully parallel 3D thinning algorithm and its applications
Computer Vision and Image Understanding
A 3D 6-subiteration thinning algorithm for extracting medial lines
Pattern Recognition Letters
Fast binary image processing using binary decision diagrams
Computer Vision and Image Understanding
A parallel 3D 12-subiteration thinning algorithm
Graphical Models and Image Processing
Digital Picture Processing
Skeletonizing Volume Objects Part 2: From Surface to Curve Skeleton
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Some topological properties of discrete surfaces
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images
DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
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 note on 'A fully parallel 3D thinning algorithm and its applications'
Pattern Recognition Letters
Curve-Skeleton Properties, Applications, and Algorithms
IEEE Transactions on Visualization and Computer Graphics
Pattern Recognition Letters
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
Journal of Mathematical Imaging and Vision
A 3D fully parallel surface-thinning algorithm
Theoretical Computer Science
Automatic Adjustment of Rigs to Extracted Skeletons
AMDO '08 Proceedings of the 5th international conference on Articulated Motion and Deformable Objects
On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels
Journal of Mathematical Imaging and Vision
Bayesian image recovery for dendritic structures under low signal-to-noise conditions
IEEE Transactions on Image Processing
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
An Automatic Correction of Ma's Thinning Algorithm Based on P-simple Points
Journal of Mathematical Imaging and Vision
Computer Vision and Image Understanding
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Adjusting animation rigs to human-like 3D models
AMDO'10 Proceedings of the 6th international conference on Articulated motion and deformable objects
Isthmus-based 6-directional parallel thinning algorithms
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
A new 3d parallel thinning scheme based on critical kernels
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A novel skeletonization and animation approach for point models
Transactions on Edutainment VII
Three-dimensional thinning algorithms on graphics processing units and multicore CPUs
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
In this paper, we propose a new methodology to conceive a thinning scheme based on the parallel deletion of P-simple points. This scheme needs neither a preliminary labelling nor an extended neighborhood, in the opposite of the already proposed thinning algorithms based on P-simple points. Moreover, from an existent thinning algorithm A, we construct another thinning algorithm A', such that A' deletes at least all the points removed by A, while preserving the same end points. In fact, we propose a 12-subiteration thinning algorithm which deletes at least the points removed by the one proposed by Palágyi and Kuba (Graphical Models Image Process. 61 (1999) 199).