In this paper a new thinning algorithm is presented. It is simple yet robus
t, and can maintain the same advantages of other key skeletonization algori
thms. In this new algorithm, only a very small set of rules of criteria for
deleting pixels is used. It is faster and easier to implement. Its advanta
ges and limitations are discussed and compared with others. Several example
s are illustrated.