A method for finding a least-cost corridor on an ordinal-scaled raster cost surface
ABSTRACTThe least-cost path problem is a widely studied problems in geographic information science. In raster space, the problem is to find a path that accumulates the least amount of cost between two locations based on the assumptions that the path is a one-dimensional object (represented by a stri...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2023-04-01
|
| Series: | Annals of GIS |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/19475683.2023.2166585 |