| 多边形骨架线与形心自动搜寻算法研究 |
| |
| 引用本文： | 陈涛,艾廷华.多边形骨架线与形心自动搜寻算法研究[J].武汉大学学报(信息科学版),2004,29(5):443-446,455. |
| |
| 作者姓名： | 陈涛 艾廷华 |
| |
| 作者单位： | 武汉大学资源与环境科学学院,武汉市珞喻路129号,430079 |
| |
| 基金项目： | 国家自然科学基金资助项目 ( 4 0 10 10 2 3 )，国家人事部留学人员回国启动基金资助项目 |
| |
| 摘 要： | 针对GIS中的应用，分析了传统的多边形骨架线与形心提取算法的不足之处，提出了一种基于约束Delaunay三角网结构的多边形主骨架线与形心的自动搜索算法，详细描述了该方法的基本思想，并在实验结果基础上分析了该算法的特点。
|
| 关 键 词： | Delaunay三角网结构 多边形骨架线 自动搜索算法 形心 GIS |
| 文章编号： | 1671-8860(2004)05-0443-04 |
Automatic Extraction of Skeleton and Center of Area Feature |
| |
| CHEN Tao,AI Tinghua.Automatic Extraction of Skeleton and Center of Area Feature[J].Geomatics and Information Science of Wuhan University,2004,29(5):443-446,455. |
| |
| Authors: | CHEN Tao AI Tinghua |
| |
| Institution: | CHEN Tao 1 AI Tinghua 1 |
| |
| Abstract: | 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. |
| |
| Keywords: | Delaunay triangulation polygon shape center skeleton searching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
