Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Kartaalgebra× | Least-Cost Path / Cost-Distance Analysis× | |
|---|---|---|
| Ämnesområde | Rumslig analys | Rumslig analys |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1990 | 1994 |
| Upphovsperson≠ | Dana Tomlin | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| Typ≠ | Raster spatial analysis framework | Raster cost-surface routing |
| Ursprungskälla≠ | Tomlin, C. D. (1990). Geographic Information Systems and Cartographic Modeling. Prentice Hall. ISBN: 978-0-13-350927-4 | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ |
| Alias | Cartographic Modeling, Raster Algebra, Grid Algebra, Harita Cebiri | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol |
| Närliggande | 3 | 3 |
| Sammanfattning≠ | Map Algebra is a rule-based language and computational framework for deriving new raster layers from existing ones by applying arithmetic, logical, or statistical operations cell by cell or across neighborhoods. Formalized by Dana Tomlin in 1990, it is the foundational algebraic system underlying raster GIS analysis and is widely used in environmental science, urban planning, hydrology, and land-use modeling whenever spatially explicit calculations on gridded data are required. | Least-cost path analysis finds the route between two locations that minimizes accumulated travel cost across a landscape, rather than minimizing straight-line distance. By encoding terrain, slope, land cover, and other frictions into a cost surface and accumulating cost outward from a source, it identifies optimal corridors for roads, pipelines, trails, power lines, and wildlife movement — a core raster-GIS technique built on Dijkstra's shortest-path logic. |
| ScholarGateDatamängd ↗ |
|
|