A Study And Implement Of Shortest Path Finding In GIS

Geographic Information Systems (GIS), which has become a synthetical technology since 1960s, has been widely used in many aspects such as resource investigating and traffic monitoring, and has already been a special field with many aspects and with the knowledge of multi-fields. In recent years, as much commercial practice in GIS has rapidly improved, electronic map service, a new kind of map service, has become more and more popular. As it has close relationship with many aspects in people's everyday life, such as intelligent traffic system, mobile GPS, and many other commercial uses, it is urgent to give a research in the electronic map searching and other relative fields. This paper researches one of the key problems in this field: Finding the shortest Path.Huge Data is a special character of GIS. Extracting, organizing and analyzing the huge data in a good way are the key point of improving the efficiency. Most of the traditional researches focus on the improvement and optimization of routing algorithm, while this paper concentrates on another aspect: how to find shortest path on a huge map data, and also develop the door2door routing system of US as an example. The paper mainly does the following things:1. Investigate about the data source: TIGER data (get from http://www.census.gov), mainly focus on its content and its organization.