摘要
文章讨论了一种在GIS环境下的最短路径规划算法,它根据用户给出的起始结点与目标结点以及必经结点序列和避开结点序列在建立的搜索图基础上分段查找最短路径,最后生成满足用户约束条件的最短路径。
In the article,a shortest path solving algorithm is proposed in GIS environment.lt finds a shortest path according into start node,goal node and strait conditionsare given by user.The algorithm has some advantages that it is extremely fast and effect,and algorithm 3'complexity is 0(n).the find-path process and the amount of computation needed are completely independent of the chosen world coordition system.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第20期70-71,共2页
Computer Engineering and Applications
基金
国家自然科学基金资助项目(编号:49631050)
