CGT: A fast thinning algorithm implemented on a sequential computer
Wen Ji Xu, Wang Chengxun · IEEE Transactions on Systems Man and Cybernetics · 1987
An approach called contour generating is proposed to reduce drastically the running time for parallel thinning algorithms on a sequential computer by providing extra storage space. The time complexity of a parallel thinning algorithm using this technique is proportional only to the object area of the image instead of the product of the whole image area and the maximum half-width of the object. Experimental results show that the proposed algorithm, called the contour generating thinning (CGT) algorithm, is the fastest of all reported thinning algorithms, and the skeletons produced are of good quality.