Powerful parallel and symmetric 3D thinning schemes based on critical kernels
From MaRDI portal
Publication:2251209
DOI10.1007/s10851-012-0402-7zbMath1291.68397MaRDI QIDQ2251209
Gilles Bertrand, Michel Couprie
Publication date: 11 July 2014
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10851-012-0402-7
collapse; parallel algorithm; skeleton; simple point; cubical complex; critical kernel; thinning algorithm
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T45: Machine vision and scene understanding
Related Items
Unnamed Item, Discrete Morse functions and watersheds, A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms, Robust Computations of Reeb Graphs in 2-D Binary Images, Portal Extraction Based on an Opening Labeling for Ray Tracing, A 3D Sequential Thinning Scheme Based on Critical Kernels
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points
- A 3D fully parallel surface-thinning algorithm
- On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
- Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
- On critical kernels
- On the dunce hat
- A characterization of parallel thinning algorithms
- A new characterization of three-dimensional simple points
- A three-dimensional holes closing algorithm
- Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes
- A New 3D Parallel Thinning Scheme Based on Critical Kernels
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete
- Sequential Operations in Digital Picture Processing
- On the Generalized Hankel and K Transformations
- Connectivity in Digital Pictures
