Cart (Loading....) | Create Account
Close category search window

Graph-reduction algorithm for finding shortest path in Geographic Information Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Puente, R.R. ; Univ. de las Cienc. Informaticas, Cuba ; Cortes, M.L.

Geographic Information Systems are computer systems that are used to store and manipulate information closely related to its geographical position. This technology has developed so rapidly in the past two decades that is already accepted as an essential tool for effective use of such information. An application of Geographic Information System is the shortest path search between two locations. The problem solved in this paper is to present a road network of a map (all objects) through a graph for subsequente network analysis, specifically for finding the shortest path and respond quickly to the users. We propose an algorithm for reducing a graph and an algorithm for searching shortest path in the reduced graph by the proposed algorithm. These results can be subsequently applied to Geographic Information Systems.

Published in:

Latin America Transactions, IEEE (Revista IEEE America Latina)  (Volume:10 ,  Issue: 6 )

Date of Publication:

Dec. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.