Process / pipelineNetwork/raster GIS
最小成本路径 / 成本距离分析
最小成本路径分析在两个地点之间寻找一条路线，该路线最小化累积的旅行成本，而不是最小化直线距离。通过将地形、坡度、土地覆盖和其他阻力编码为成本表面，并从源头累积成本向外扩展，可以识别道路、管道、小径、电力线和野生动物迁徙的最佳走廊——这是基于 Dijkstra 最短路径逻辑的核心栅格 GIS 技术。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI: 10.1007/BF01386390 ↗
- Douglas, D. H. (1994). Least-cost path in GIS using an accumulated cost surface and slopelines. Cartographica, 31(3), 37–51. DOI: 10.3138/D327-0323-2JUT-016M ↗
如何引用本页
ScholarGate. (2026, June 2). Least-Cost Path / Cost-Distance Analysis. ScholarGate. https://scholargate.app/zh/spatial-analysis/least-cost-path
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →