期刊名称：ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
印刷版ISSN：2194-9042
电子版ISSN：2194-9050
出版年度：2009
卷号：XXXVIII-7/C4
页码：272-276
出版社：Copernicus Publications
摘要：Skeleton is an important 1-D descriptor of polygon and a useful tool for advanced geometric algorithms. However the skeleton that most existing algorithms investigated is the longest one, which is not intended in all circumstances. This paper proposes an algorithm for extracting hierarchically optimal skeleton network of polygons. The algorithm incorporates length, angularity and area of associated part of skeleton segment. The result is a hierarchical structure and each level corresponds to a specific detail of skeleton. The new algorithm has three steps. First the constrained Delaunay triangulation of polygons is constructed. Secondly skeleton segments are connected between neighbouring triangles and skeleton network is built. Thirdly, a dynamic pruning process considering the weights is employed to produce optimal skeletons at each level of detail. The weight in last step is determined by length, angularity and position of skeleton segment
