中国惯性技术学报
中國慣性技術學報
중국관성기술학보
JOURNAL OF CHINESE INERTIAL TECHNOLOGY
2009年
6期
670-676
,共7页
大规模数字地图%网络%拓扑%空间索引%算法复杂度
大規模數字地圖%網絡%拓撲%空間索引%算法複雜度
대규모수자지도%망락%탁복%공간색인%산법복잡도
large scale digital maps%network%topological information%spatial index%algorithm complexity
道路网络的拓扑信息是GIS进行空间分析,如最优路径、地图匹配等算法的数据基础.目前,获取和建立道路网络的拓扑信息非常繁琐,不仅费时、费力,并且容易出错.采用逻辑分幅物理统一的存储策略,在探讨了拓扑生成的一般算法的前提下,提出了大规模超大规模数字地图自动生成道路网络拓扑关系的步骤和算法.该算法采用网格索引检索每个子图的元素,用hash索引映射实体ID和实体对象信息,并将整图的拓扑信息生成转化为对每个子图的拓扑求取,并对跨子图道路拓扑求解特别讨论.然后,对算法复杂度进行了分析,并且通过建立不同道路数的多个虚拟道路网络子图对算法性能进行了测试和比较.最后用本算法跟踪处理了南京市道路网络(部分),并给出了结果.本算法在保留地理数据完整性的前提下,解决了常规方法的内存限制,并且具有准线性的运算代价,并能够自动恢复数据处理.
道路網絡的拓撲信息是GIS進行空間分析,如最優路徑、地圖匹配等算法的數據基礎.目前,穫取和建立道路網絡的拓撲信息非常繁瑣,不僅費時、費力,併且容易齣錯.採用邏輯分幅物理統一的存儲策略,在探討瞭拓撲生成的一般算法的前提下,提齣瞭大規模超大規模數字地圖自動生成道路網絡拓撲關繫的步驟和算法.該算法採用網格索引檢索每箇子圖的元素,用hash索引映射實體ID和實體對象信息,併將整圖的拓撲信息生成轉化為對每箇子圖的拓撲求取,併對跨子圖道路拓撲求解特彆討論.然後,對算法複雜度進行瞭分析,併且通過建立不同道路數的多箇虛擬道路網絡子圖對算法性能進行瞭測試和比較.最後用本算法跟蹤處理瞭南京市道路網絡(部分),併給齣瞭結果.本算法在保留地理數據完整性的前提下,解決瞭常規方法的內存限製,併且具有準線性的運算代價,併能夠自動恢複數據處理.
도로망락적탁복신식시GIS진행공간분석,여최우로경、지도필배등산법적수거기출.목전,획취화건립도로망락적탁복신식비상번쇄,불부비시、비력,병차용역출착.채용라집분폭물리통일적존저책략,재탐토료탁복생성적일반산법적전제하,제출료대규모초대규모수자지도자동생성도로망락탁복관계적보취화산법.해산법채용망격색인검색매개자도적원소,용hash색인영사실체ID화실체대상신식,병장정도적탁복신식생성전화위대매개자도적탁복구취,병대과자도도로탁복구해특별토론.연후,대산법복잡도진행료분석,병차통과건립불동도로수적다개허의도로망락자도대산법성능진행료측시화비교.최후용본산법근종처리료남경시도로망락(부분),병급출료결과.본산법재보류지리수거완정성적전제하,해결료상규방법적내존한제,병차구유준선성적운산대개,병능구자동회복수거처리.
Topological information in road networks is critical for GIS system to support various kinds of functionalities such as spatial analysis, optimal path finding, and map-matching. Currently, to obtain and create such information is quite time-consuming, energy-consuming, and easy to put error data into database. In this paper, based on physically-integral-logic-division storage strategy and the basic algorithm of creating topological information, an automatic algorithm is proposed for creating topological information in large-scale digital navigation maps. The given algorithm utilizes grid index to search all entities in a sub-map, and uses hash index to map geographical object ID to a geographical object. Through tracing roads in each sub-map, the topological information in the whole large-scale digital map can be automatically updated. Then, the computing complexity of the algorithm is discussed, and the performance is evaluated using simulated road network with different road numbers. Finally, a Nanjing local-area road map is processed using the algorithm, and the result is given. The proposed algorithm can resolve memory limitation issue when handling large scale digital maps, and is featured with advantages such as quasi-linear-cost, being able to recover from interruption.