Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points

DOI10.1016/j.patcog.2006.12.032zbMath1115.68157OpenAlexW4318470515MaRDI QIDQ882279

Gilles Bertrand, Christophe Lohou

Publication date: 23 May 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.12.032

zbMATH Keywords

topology preservationdigital topologysimple point\(P\)-simple point3D symmetrical thinning algorithmtopological number

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

A 3D fully parallel surface-thinning algorithm ⋮ Powerful parallel and symmetric 3D thinning schemes based on critical kernels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A topological characterization of thinning
• Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
• A 3D 12-subiteration thinning algorithm based on \(P\)-simple points
• Strong thinning and polyhedric approximation of the surface of a voxel object
• Some topological properties of surfaces in \(Z^3\)
• A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
• A medial-surface oriented 3-d two-subfield thinning algorithm
• Two 3D symmetrical thinning algorithms based on P-simple points
• A 3D 6-subiteration thinning algorithm for extracting medial lines
• A new characterization of three-dimensional simple points
• A New 3D 12-Subiteration Thinning Algorithm Based on P-Simple Points

This page was built for publication: Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points