Answers are grounded in this paper and cite their sources.
Algorithmic study demonstrates rapid parallel thinning for digital patterns, indicating effective skeletonization while preserving connectivity.
A fast parallel thinning algorithm is proposed in this paper. It consists of two subiterations: one aimed at deleting the south-east boundary points and the north-west corner points while the other one is aimed at deleting the north-west boundary points and the south-east corner points. End points and pixel connectivity are preserved. Each pattern is thinned down to a "skeleton" of unitary thickness. Experimental results show that this method is very effective.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: