| 地图目标群间骨架线提取的算法研究 |
| |
| 引用本文： | 刘远刚,郭庆胜,孙雅庚,林青,郑春燕.地图目标群间骨架线提取的算法研究[J].武汉大学学报(信息科学版),2015,40(2):264-268. |
| |
| 作者姓名： | 刘远刚 郭庆胜 孙雅庚 林青 郑春燕 |
| |
| 作者单位： | 1武汉大学资源与环境科学学院湖北 武汉 430079;2武汉大学测绘遥感信息工程国家重点实验室湖北 武汉 430079;3长江大学地球科学学院湖北 武汉 430100;4嘉应学院地理科学与旅游学院广东 梅州 514015 |
| |
| 基金项目： | 国家自然科学基金资助项目(41071289,41471384,41171350,41101351,41201474);中央高校基本科研业务费专项资金资助项目(2012205020212);国家863计划资助项目(2012AA12A402);数字制图与国土信息工程国家测绘地理信息局重点实验室开放研究基金资助项目(GCWD201102)~~ |
| |
| 摘 要： | 基于Delaunay三角网提取的骨架线是地图综合中广泛应用的一种空间剖分结构。改进了一种基于约束Delaunay三角网的地图目标群间骨架线提取算法,从程序设计的角度详细描述了算法的数据结构和控制流程。按照三角网中三角形包含约束边的数目,将三角形分为0、1、2、3四类,将0类、2类和单连通的1类三角形视为骨架线追踪的起点或终点,将双连通的1类作为中间通道,对整个三角网进行遍历。针对三角网中的环路、3类三角形等特殊情况,在改进的算法中提出了相应的处理方法。该算法成功地用于等高线的内插和街区地图目标群的邻近分析,验证了算法的可行性和健壮性。
|
| 关 键 词： | 骨架线提取 地图综合 Delaunay三角网 地图目标群 |
| 收稿时间： | 2013-09-24 |
An Algorithm for Skeleton Extraction Between Map Objects |
| |
| LIU Yuangang;GUO Qingsheng;SUN Yageng;LIN Qing;ZHENG Chunyan.An Algorithm for Skeleton Extraction Between Map Objects[J].Geomatics and Information Science of Wuhan University,2015,40(2):264-268. |
| |
| Authors: | LIU Yuangang;GUO Qingsheng;SUN Yageng;LIN Qing;ZHENG Chunyan |
| |
| Institution: | 1School of Resource and Environmental Sciences Wuhan University Wuhan 430079 China;2State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan 430079 China;3School of Geoscience Yangtze University Wuhan 430100 China;4School of Geographical Science and Tourism Jiaying University Meizhou 514015 China |
| |
| Abstract: | The Delaunay triangulation skeleton is a widely applied spatial partitioning structure for cartographic generalization. An algorithm for skeleton extraction of the gap space between map objects based on a constrained Delaunay triangulation was improved. From the perspective of program design，we describe the data structure and the control process of the algorithm in detail. According to the number of constrained edges,triangles are assigned into four types，i. e.，type-0，type-1，type-2 and type-3. By using type-0，type-2 and single-path type-1 triangles as starting or ending triangles，and two-path type-1 triangles as channel triangles，the whole triangulation is traversed. In addition，corresponding treatments are proposed for some special cases，e. g.，looped triangle paths of and type-3 triangles.The algorithm is used for contour interpolation and proximity analysis of map objects in a district. The results show that the algorithm is feasible and robust. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
| 点击此处可从《武汉大学学报(信息科学版)》下载免费的PDF全文 |
