Improved vector route algorithm bases on veaster topological space model

Net analysis is one of the most important space analysis functions. Finding a route is the basic function of net analysis in GIS, the kernel of which is to get the optimized route. This paper presents a topological space model, which saves all points in the vector-graph layer based on a grid method and improves the classical Dijkstra algorithm bases on the raster topological space model. This improves efficiency in time of the route planning. At the same time, it decreases the memory occupancy, so the new algorithm can be used on a small memory terminal.