On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
DOI10.1007/S10851-009-0152-3zbMATH Open1490.68260OpenAlexW1990148783MaRDI QIDQ993540FDOQ993540
Gilles Bertrand, Michel Couprie
Publication date: 20 September 2010
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00731784/file/mns4d_R1.pdf
Recommendations
- Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
- A New 3D Parallel Thinning Scheme Based on Critical Kernels
- Isthmus-based parallel and asymmetric 3D thinning algorithms
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Minimal non-simple sets in 4D binary images
collapsesimple pointtopology preservationcubical complex4D spacecritical kernelminimal non-simple setP-simple pointparallel thinning
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of digital topology (68U03)
Cites Work
- On the dunce hat
- Title not available (Why is that?)
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Title not available (Why is that?)
- Computer graphics and connected topologies on finite ordered sets
- Simplicial Spaces, Nuclei and m -Groups
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- On critical kernels
- Title not available (Why is that?)
- Minimal non-simple sets in 4D binary images
- Combinatorial Image Analysis
- A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
- Strong thinning and polyhedric approximation of the surface of a voxel object
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- Title not available (Why is that?)
- Tests for connectivity preservation for parallel reduction operators
- A characterization of parallel thinning algorithms
- Title not available (Why is that?)
- Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
- A New 3D Parallel Thinning Scheme Based on Critical Kernels
Cited In (12)
- Metrical properties of a collection of 2D parallel thinning algorithms
- Thinning Algorithms as Multivalued ${\mathcal{N}}$ -Retractions
- Sufficient conditions for topology-preserving parallel reductions on the BCC grid
- A noniterative thinning algorithm
- Discrete Topological Transformations for Image Processing
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Homological spanning forest framework for 2D image analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms
- On topology preservation of mixed operators in triangular, square, and hexagonal grids
This page was built for publication: On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q993540)
