A 3D 12-subiteration thinning algorithm based on \(P\)-simple points

DOI10.1016/j.dam.2002.11.002zbMath1072.68635OpenAlexW1976951789MaRDI QIDQ1827821

Christophe Lohou, Gilles Bertrand

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2002.11.002

zbMATH Keywords

\(P\)-simple pointDigital topologyTopology preservation3D thinning algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items

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, New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces, A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• A characterization of parallel thinning algorithms
• A 3D 6-subiteration thinning algorithm for extracting medial lines
• Fast Binary Image Processing Using Binary Decision Diagrams
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item