Analysis of thinning algorithms

Uses a combinatorial approach to analyse the differences of thinning algorithms among iteration and sub-iteration, thinning by coordinate and by edges of patterns. The authors also propose a serial model thinning algorithm in which the skeletons only consist of three types of points: connected points, end-points, and hole-points.<<ETX>>