分类
计算机科学
算法
矢量地图
二次方程
图形
树(集合论)
时间复杂性
拓扑排序
理论计算机科学
有向图
人工智能
数学
数学分析
几何学
情报检索
作者
Shibumon Alampatta,M A Rajesh,Narayan Panigrahi
标识
DOI:10.1109/rait.2016.7507967
摘要
Modeling of a graph corresponding to transport network from vector layers of a digital map is essential to carry out any sort of network analysis operations. In vector maps, feature objects in road layers are generally modeled as simple features which do not capture the connectivity information. This paper proposes a method for building a network/graph model from such road layers of a vector map. In this work a quad tree based algorithm for building of network is proposed, which offers a linear time complexity whereas the trivial method is quadratic in order of complexity.
科研通智能强力驱动
Strongly Powered by AbleSci AI