Introduction | Task 1. Given an origin, how do I calculate an accumulated cost surface? | Task 2. Can I use a terrain factor for a given terrain type? | Task 3. Can cost be expressed as metabolic energy rather than time? | Task 4. Can the walking speed be worked out internally? | Task 5. Can the 'cognitive slope' be used? | Task 6. Can least-cost paths to one or more destinations be calculated? | Task 7. Can the paths back to the origin be calculated? | Task 8. Can a least-cost corridor be calculated? | Task 9. Can I compare paths from different cost functions? | Task 10. What if I do not have an elevation raster? | Task 11. Can I calculate a walking-cost boundary, e.g. a 45-minute catchment? | Task 12. Can I carry out a cost-allocation analysis? | Task 13. Can I show isolines inside each allocation zone? | Task 14. Can I calculate a network of least-cost paths? | Task 15. Can I calculate the density of a network of paths? | Task 16. My DTM has NoData (sea); how do I stop paths crossing it? | Task 17. Can I include a barrier (an area where movement is inhibited)? | Task 18. Can I calculate sub-optimal (ranked) least-cost paths? | Task 19. Can the ranked paths be drawn over a least-cost corridor? | Task 20. Can barriers be used with ranked paths? | Task 21. Can I visualise the length and cost of each ranked path? | Saving, exporting, and the cost-function catalogue | Reference
Package: movecost 3.0.0
movecost: Calculation of Slope-Dependant Accumulated Cost Surface, Least-Cost Paths, Least-Cost Corridors, Least-Cost Networks Related to Human Movement Across the Landscape
Provides the facility to calculate non-isotropic accumulated cost surfaces, least-cost paths, least-cost corridors, least-cost networks, ranked alternative paths, cost allocation and cost boundaries, using a number of human-movement-related cost functions that can be selected by the user. The package is built around a compute-once design: a single cost surface object is created first and then reused by every analysis function, avoiding redundant computation. Visualisation is fully decoupled from computation and is provided through 'ggplot2' methods that can be invoked, customised, and re-invoked at any time without re-running any analysis. It just requires a Digital Terrain Model, a start location and (optionally) destination locations. See Alberti (2019) <doi:10.1016/j.softx.2019.100331>.
Authors:
movecost_3.0.0.tar.gz
movecost_3.0.0.zip(r-4.7)movecost_3.0.0.zip(r-4.6)movecost_3.0.0.zip(r-4.5)
movecost_3.0.0.tgz(r-4.6-any)movecost_3.0.0.tgz(r-4.5-any)
movecost_3.0.0.tar.gz(r-4.7-any)movecost_3.0.0.tar.gz(r-4.6-any)
movecost_3.0.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
movecost/json (API)
| # Install 'movecost' in R: |
| install.packages('movecost', repos = c('https://gianmarcoalberti.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated from:e024cf8711. Checks:9 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-x86_64 | OK | 217 | ||
| source / vignettes | OK | 258 | ||
| linux-release-x86_64 | OK | 190 | ||
| macos-release-arm64 | OK | 128 | ||
| macos-oldrel-arm64 | OK | 118 | ||
| windows-devel | OK | 134 | ||
| windows-release | OK | 121 | ||
| windows-oldrel | OK | 121 | ||
| wasm-release | OK | 135 |
Exports:mc_accummc_allocmc_boundarymc_compmc_corridormc_cost_functionsmc_destin_locmc_dtmmc_etna_boundarymc_etna_endmc_etna_startmc_exportmc_loadmc_malta_dtmmc_networkmc_pathsmc_rankmc_savemc_springsmc_surfacemc_volcmc_volc_locmoveallocmoveboundmovecompmovecorrmovecostmovenetwmoverank
Dependencies:classclassIntclicpp11DBIe1071farverggplot2gluegtableigraphisobandKernSmoothlabelinglatticelifecyclemagrittrMASSMatrixpkgconfigproxyR6RColorBrewerRcpprlangs2S7scalessfterraunitsvctrsviridisLitewithrwk
