Analysis Of Shortcut Base On Angle Of Vector

Along with the foundation of geography information industry and the prevalence of digital information manufacture all over the world, geography information system will go deep into every walk of life and every family, and become implement and assistant in people's produce, life, study and work indispensably.The main purpose of analysis of networks in GIS is to carry through geography analysis and shape up of geography network and city basic establishment network(as traffic network, all reticle, electri line, telephone line, flow pipe and watershoot etc.)Shortcut is the basic and key problem in GIS's analysis of networks. it has direct applied value in analysis of traffic network framework, choice of transport line, build and maintenance of communication line, minimal cost analysis of freightage and layout of city public traffic network.The recognized best solution to shortcut is the tab measure, which E.W.Dijkstar advanced in 1959, but it has some question in storage and circulate efficiency in material realization .This paper improves on Dijkstra arithmetic in two aspects, one is graphics data's storage structure, another is search strategy of shortcut vertex, and advances a shortcut search arithmetic basing on Angle of Vector. This method designs an Object Oriented data's storage structure to store node and arc in networkchart. This arithmetic economizes large numbers of memory, relative to the adjoin matrix and adjoin table in Dijkstra arithmetic.In shortcut search, this arithmetic imports a gene-Angle of Vector, utilizes the topology of point and line in networkchart, improves search trend, and combines the spatial information and attribute information preferably,considering the length(as power) of arc.In experiment, the result can satisfy the actual request in veracity and speed.