摘要
研究了目前构建路网示意性地图的主要方法——其核心是依据迭代过程的后置拓扑检验一致的迭代移位算法的原理与性能,考虑到由于缺少整体与局部的空间回溯过程以及后置拓扑检验集的不完备性,导致路网约束发生异常,造成迭代移位算法无法有效示意化路网的问题,提出了一种新的路网示意性地图非迭代构建算法——环约束算法。该算法以环为单位依据邻接顺序依次定位各环,通过几何约束限制潜在的拓扑冲突,从而提高了其性能。与迭代移位算法的对比试验结果表明,该算法可以同时顾及线段角度与线段长度约束,能够有效地抑制拓扑冲突,而且由于没有迭代移位过程,因而算法速度快,可用于大规模路网示意化地图生成。
Based on the study of the principle and performance of the iterative shifting algorithm, the main method to con- struct the schematic map for road networks with its core of the consistency of iteration process＇ post topological test, a new non-iterative algorithm for schematic map construction, called the ring constraint algorithm, was presented to avoid the iterative shifting algorithm＇ s problem of incapable of effective achieving schematic roads due to the abnormality of road network constraints caused by lacking the whole and local space backtracking processes and the incompleteness of the post topology test set. The algorithm uses the ring as the unit of the network, poses all rings based on the adjacency order and limits the potential topological conflicts by geometry constraints, thus its performance is improved. The experimental resuhs show that, compared with the iterative shifting algorithm, the proposed algorithm can take into account of the line angle as well as length constraints, can effectively suppress topological conflicts, and can be used for generation of large-scale road network schematic maps since it is fast and has no iterative process.
出处
《高技术通讯》
CAS
CSCD
北大核心
2015年第6期552-560,共9页
Chinese High Technology Letters
基金
国家自然科学基金(41161061
40901197)资助项目
关键词
路网
示意性地图
环
几何约束
非迭代算法
road Network, schematic map, ring, geometry constraints, non-iterative algorithm
