Abstract
An algorithm for segmenting 2D shapes into parts is described. The segmentation is constructed from the local symmetry axes of the shape. The local symmetry axes are determined by analyzing the local symmetries of the level curves of a function which is the solution of an elliptic PDE. The segmentation has the structure of a directed graph. The shapes need not be presmoothed and the algorithm may be applied to a complexscene consisting of many objects.
Cite
CITATION STYLE
Shah, J. (2001). Segmentation of shapes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2106, pp. 236–244). Springer Verlag. https://doi.org/10.1007/3-540-47778-0_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
