A new skeletonization algorithm based on the constrained Delaunay triangulation (CDT) is proposed in this paper. The CDT partitions a shape into a set of nonoverlapping triangles which represent the shape's local symmetry properties and interconnecting relationships between branches. The skeleton of the shape is generated from the skeletons of the triangles. Methods for removing skeletonization artefacts are provided. An outstanding feature of the algorithm is that the structural information at intersections of a shape is preserved in its skeleton.
['Ju Jia Zou', 'Hung-Hsin Chang', 'Hong Yan']
A new skeletonization algorithm based on constrained Delaunay triangulation