Abstract
In planning routes for roads and canals, topography is often a significant constraint. Among the infinite number of possible trajectories between two points, the selected path should be a good approximation to the one with the least cost, and should avoid extremes of slopes. In the case of a canal, the number of uphill reaches of the trajectory should be minimised. This paper presents a least-cost-path algorithm developed to find the best path given the topography, the start and end-points of the linear feature (canal or road) and a function relating slope, distance and cost. The algorithm is based on dynamic programming techniques adapted to solve problems on the grid, or raster structure usually used in Geographical Information Systems. The algorithm was programmed and used to solve hypothetical problems. Although real cost functions were not used, the results were coherent and showed the algorithm's capabilities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Geographical Information Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
