最优路径查询和GPS应用于城市地图查询和导航将会变得更加的方便快捷。本论文根据迪杰斯特拉（Dijkstra）最短路径算法，查询最短路径。在地图数据库中各关键点存储的时候，加入该点的经度和纬度。这样，当你拥有一部GPS手持仪时，你可以方便的知道自己在地图的哪个位置，并且只根据经度和纬度就能找到自己想去的地方。
本论文使用Visual Studio 2005和SQL Server 2000，基于昆明市地图开发了一个系统，实现了道路网络中任意两点间最短路径的快速查询，和点在地图上的定位。

【关键词】GPS    最短路径  Dijkstra算法 
Abstract

Optimal path for application of GPS and city maps and navigation will become a more convenient and efficient. In this paper, according to Dijkstra  shortest path algorithm, for the shortest path. A map database of the key points of storage, to accede to the point of latitude and longitude. In this way, when you have a handheld GPS instrument, you can easily know what the map of the location, and only in accordance with longitude and latitude will be able to find their own place you want to visit.
The paper use Visual Studio  2005 and SQL Server 2000 , Kunming map based on the development of a system and realized the road network in the shortest path between any two points for the rapid, and the point on the map of the location.【Key Word】  GPS , Shortest Path , Dijkstra’s Algorithm

上一页  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]  ... 下一页  >>