a shortest path algorithm in GIS applications
碩士 === 淡江大學 === 資訊管理學系 === 92 === The shortest path algorithm is a useful technique and application of geographical information systems (GIS). The application of the shortest path is convenience to climbing, driving and other outdoor sports. The algorithm presented in this paper base on e...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67001444653438775773 |
| Summary: | 碩士 === 淡江大學 === 資訊管理學系 === 92 === The shortest path algorithm is a useful technique and application of geographical information systems (GIS). The application of the shortest path is convenience to climbing, driving and other outdoor sports.
The algorithm presented in this paper base on expanding operation which is adapted to solve the computation of least-cost-path 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.
|
|---|