| 多边形主骨架线提取算法的设计与实现 |
| |
| 引用本文： | 王中辉,闫浩文.多边形主骨架线提取算法的设计与实现[J].地理与地理信息科学,2011,27(1):42-44,48. |
| |
| 作者姓名： | 王中辉 闫浩文 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院; |
| |
| 基金项目： | 国家自然科学基金(40871208); 教育部新世纪优秀人才支持计划基金(NCET-07-0404) |
| |
| 摘 要： | 在Delaunay三角网的基础上对骨架线节点进行了分类,通过确定主骨架线的两个端点,运用回溯法提取了多边形的主骨架线,同时给出了详细的算法步骤,并在Visual C++2003环境下实现了该算法。较之其他算法,该算法思路简捷,易于编程,生成的主骨架线形态优良,较好地反映了多边形的主体形状特征和主延伸方向。
|
| 关 键 词： | 主骨架线 Delaunay三角网 多边形 |
Design and Implementation of an Algorithm for Extracting the Main Skeleton Lines of Polygons |
| |
| WANG Zhong-hui,YAN Hao-wen.Design and Implementation of an Algorithm for Extracting the Main Skeleton Lines of Polygons[J].Geography and Geo-Information Science,2011,27(1):42-44,48. |
| |
| Authors: | WANG Zhong-hui YAN Hao-wen |
| |
| Institution: | WANG Zhong-hui,YAN Hao-wen(School of Mathematics,Physics & Software Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| |
| Abstract: | In the algorithm,based on Delaunay triangulation of polygon,the nodes in the skeleton lines are divided into 3 types:endpoint,branch point and jumper point.First,the diameter of convex hull that is constructed by all endpoints is calculated.Second,two endpoints in the diameter is selected as the beginning and ending points of the main skeleton line.Third,the backtracking algorithm is used to search orderly other nodes to form the main skeleton line.The algorithm is concise and easy to program compared with ... |
| |
| Keywords: | main skeleton lines Delaunay triangulation polygons |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
