渐进式改进的线要素简化算法探讨  

Discussion on the progressive improved algorithm for cartographic generalization of line features

作　　者：李朝奎[1] 骆文芳[1] 陈果[1] 严雯英 

机构地区：[1]湖南科技大学地理空间信息技术国家地方联合工程实验室/地理空间信息湖南省工程实验室,湖南湘潭411201

出　　处：《测绘科学》2015年第11期123-126,共4页Science of Surveying and Mapping

基　　金：国家自然科学基金项目(41271390);国家国际科技合作专项(2011DFG23330);卫星测绘技术与应用国家测绘地理信息局重点实验室开放基金项目(KLAMTA-201406)

摘　　要：针对经典的线要素全局化简综合算法D-P算法因缺乏拓扑控制而易产生自相交问题,且阈值选取不确定、严重影响简化结果的不足,文章在分析D-P算法优缺点的基础之上,提出了渐进式改进方法,并对改进算法进行了实验验证。结果表明:改进后的D-P算法优化了线状要素的化简综合结果,且提高了简化计算效率。Aiming at the insufficiency of D-Palgorithm,the classic global simplification algorithm of line features that is liable to create the intersection problems due to lack of topological control,and the selection of the thresholds is indefinite which impacts the generalization result,the paper proposed a progressive improved algorithm based on the analysis of disadvantage and advantage of D-Palgorithm.Experimental result showed that the method would not only optimize the simplification of line features,but also improve the computational efficiency.

关 键 词：D-P算法 线要素 化简算法 制图综合 

分 类 号：P283[天文地球—地图制图学与地理信息工程]