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

DOI10.1007/S10851-009-0152-3zbMath1490.68260OpenAlexW1990148783MaRDI QIDQ993540

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

collapsetopology preservationsimple pointcubical 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)

Cites Work

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

Related Items (8)

Homological spanning forest framework for 2D image analysis ⋮ Sufficient conditions for topology-preserving parallel reductions on the BCC grid ⋮ Unnamed Item ⋮ A noniterative thinning algorithm ⋮ Discrete Topological Transformations for Image Processing ⋮ Powerful parallel and symmetric 3D thinning schemes based on critical kernels ⋮ 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