| 基于图分割的可变比例尺地图分幅回溯算法 |
| |
| 作者姓名： | 魏智威 丁愫 孟爽 童莹 程璐 |
| |
| 作者单位： | 中国科学院空天信息创新研究院网络信息体系技术院重点实验室,北京,100094;浙江农林大学环境与资源学院,浙江 杭州,311300;湖北省国土测绘院,湖北 武汉,430019;武汉大学资源与环境科学学院,湖北 武汉,430079;武汉大学资源与环境科学学院,湖北 武汉,430079 |
| |
| 摘 要： | 总结了地图分幅需遵循的原则,并针对地图集中可变比例尺的分幅,将其定义为基于约束条件的图分割问题,用最小生成树(minimum spanning tree,MST)将制图区域关联起来,基于回溯算法对MST裁剪实现地图集的分幅。实验结果表明,所提出的方法能较好顾及地图集分幅的相关原则,满足地图集制作的要求。同时,利用该方法设计的地图集分幅工具已成功应用于《武汉市汉阳地区地名图集》等的制作,有效提高了地图设计人员的工作效率。
|
| 关 键 词： | 地图集 地图设计 地图分幅设计 回溯算法 最小生成树 |
A Graph Cutting and Backtracking Approach for Variable Scale Map Subdivision |
| |
| Authors: | WEI Zhiwei DING Su MENG Shuang TONG Ying CHENG Lu |
| |
| Institution: | (Key Laboratory of Network Information System Technology,Aerospace Information Research Institute,Chinese Academy of Sciences,Beijing 100094,China;College of Environmental and Resource Science,Zhejiang A&F University,Hangzhou 311300,China;Hubei Institution of Land Surveying and Mapping,Wuhan 430019,China;School of Resources and Environmental Sciences,Wuhan University,Wuhan 430079,China) |
| |
| Abstract: | Relevant constraints in map subdivision are summarized. For variable scale map subdivision in atlases, we convert it into a graph cutting problem, connect sub-areas with a minimum spanning tree(MST), and provide a backtracking strategy for MST cut to realize map subdivision. The result shows that the proposed approach can well satisfy constraints in map subdivision and meet the requirements of map compilation. The tool for map subdivision based on the proposed approach has been applied successfully in the production of atlases such as Place Names Atlas of Hanyang District, Wuhan and improves the working efficiency of cartographer. |
| |
| Keywords: | atlas map design map subdivision design backtracking strategy minimum spanning tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
