On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels

DOI10.1007/S10851-009-0152-3MaRDI QIDQ993540zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

collapsesimple pointtopology preservationcubical complex4D spacecritical kernelminimal non-simple setP-simple pointparallel thinning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of digital topology (68U03)

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

Cites work

• scientific article; zbMATH DE number 3678765 (Why is no real title available?)
• scientific article; zbMATH DE number 3749890 (Why is no real title available?)
• scientific article; zbMATH DE number 1104449 (Why is no real title available?)
• scientific article; zbMATH DE number 850888 (Why is no real title available?)
• scientific article; zbMATH DE number 3411897 (Why is no real title available?)
• A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
• A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• A characterization of parallel thinning algorithms
• Combinatorial Image Analysis
• Computer graphics and connected topologies on finite ordered sets
• Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
• Minimal non-deletable sets and minimal non-codeletable sets in binary images
• Minimal non-simple sets in 4D binary images
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• On critical kernels
• On the dunce hat
• Simplicial Spaces, Nuclei and m -Groups
• Strong thinning and polyhedric approximation of the surface of a voxel object
• Tests for connectivity preservation for parallel reduction operators

Cited in

(15)

• scientific article; zbMATH DE number 2087453 (Why is no real title available?)
• Metrical properties of a collection of 2D parallel thinning algorithms
• Thinning Algorithms as Multivalued ${\mathcal{N}}$ -Retractions
• New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
• Sufficient conditions for topology-preserving parallel reductions on the BCC grid
• A noniterative thinning algorithm
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
• Homological spanning forest framework for 2D image analysis
• Discrete topological transformations for image processing
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• scientific article; zbMATH DE number 7714764 (Why is no real title available?)
• scientific article; zbMATH DE number 4051044 (Why is no real title available?)
• 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)