Using path-finding algorithms of graph theory for route-searching in geographical information systems

This paper deals with graph theory application in large-scale geographical data searching and visualization. We present a comparison of two path-finding algorithms of graph theory, i.e. blind-search and A* algorithm, that results into the selection of the second one for implementation within a geographical information system. The main goal is to process the terrain map representation in the form of a graph during route-searching between start and target positions, and during the visualization and animation of the results of this search. We show the implementation results on random city map and on real three-dimensional model of our university campus. Finally, we discuss further directions of current work.