A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms

DOI10.1016/j.dam.2016.03.012zbMath1370.68313OpenAlexW2343704263MaRDI QIDQ528331

Gábor Németh, Kálmán Palágyi

Publication date: 12 May 2017

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

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

zbMATH Keywords

thinningtopology preservationskeletonizationfully parallel thinningorder-independent sequential thinning

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Medial representations. Mathematics, algorithms and applications
• 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
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• Characterization of the deletion of \((26, 6)\)-simple points as multivalued \((\mathcal{N}, 26)\)-retractions
• Thinning Methodologies for Pattern Recognition
• Equivalent Sequential and Parallel Subiteration-Based Surface-Thinning Algorithms
• Order independent homotopic thinning for binary and grey tone anchored skeletons
• Topology Preserving Parallel 3D Thinning Algorithms
• Equivalent 2D Sequential and Parallel Thinning Algorithms
• New Removal Operators for Surface Skeletonization

This page was built for publication: A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms