摘要
针对GIS中的应用 ,分析了传统的多边形骨架线与形心提取算法的不足之处 ,提出了一种基于约束Delaunay三角网结构的多边形主骨架线与形心的自动搜索算法 ,详细描述了该方法的基本思想 。
Reviewing the traditional vector parallel line based and raster based method for extracting the skeleton and center of polygon, this paper presents an approach to the automatic extraction of skeleton and center based on the constraint Delaunay triangulation. The triangle in the local joint location acts as the root of the extraction tree. This paper calculates the area size split by the above triangle and makes the extension continue in the two directions whose areas are bigger. The operation repeats until all extensions ends at the vertex of polygon. The connection of all the midpoints of triangle's edges in sequence forms the skeleton of polygon. The algorithm is developed in detail and its properties are analyzed by experiment.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2004年第5期443-446,455,共5页
Geomatics and Information Science of Wuhan University
基金
国家自然科学基金资助项目 ( 4 0 10 10 2 3 )
国家人事部留学人员回国启动基金资助项目
