The Electronic Map Navigation System Design And Realization Based On The MapInfo Platform

Along with the universality and development of the computer and the network, GIS gets increasingly and extensively application because its strong function. Along with the continuously perfect GIS function, each function module is demarcated more clearer, the Component GIS is the further development of these characteristics, according to the standard Component platform, each module of it can free vivid reorganization, have the interface that use convenient standard to connect, it provide a new way for the development of the GIS applies system. The shortest route problem according to the diagram is the basic problem in the network analysis, it is the foundation of the optimization problem, and occupy an important position in the transportation network analysis system, the shortest route analysis has an extensive application in the vehicle navigation system and various city emergency system.This thesis aims at amending the shortage of the traditional GIS independence development mode existence, carry on an analytical research to the component GIS and the vehicle navigation system, and carry on a comparison in many ways from the data model, the data organization, and the function characteristic to the component GIS product, choose MapInfo to carry on the development of the electronic map navigation system. Aim at the shortage of the traditional software development in the design process, adapt UML as the basic application of the electronic map navigation system, insures the credibility of the system software. Apply MapInfo as the component technique and the shortest route algorithm on the function model, carry on a concrete realization to the electronics map navigation system software. This system realization provides a new mode for the component GIS application.Combining the shortest route model development, this thesis carried on an research and analysis according to the diagram theory of the path programming, and make a compare choice between various classic shortest route algorithms, aim at the shortage of original Dijkstra calculate way, carried on an improvement from the calculator data structure and realistic transportation factor, and put forward a kind of forward connection side structure, consider limit conditional shortest route algorithm, make the algorithm have high-efficiency, and obtained good result in the emluator.