Skeletonization algorithm running on path-based distance maps

A new skeletonization algorithm is introduced which runs on the distance map of a digital figure, computed according to any among four commonly used path-based distance functions. The skeletonization algorithm has a number of features: it is reversible, since it detects the centres of the maximal disks; it is nearly invariant under figure rotation (when the adopted distance function provides a reasonably good approximation to the Euclidean distance); it includes two steps (pruning and beautifying), which allow us to simplify skeleton structure according to the user's needs, as well as to improve skeleton aesthetics; and its computational load is limited, whatever the size of the figure to be skeletonized.