Iterative least cost path and minimum spanning tree methods for projecting forest road networks. The methods connect a set of target points to an existing road network using 'igraph' <https://igraph.org> to identify least cost routes. The cost of constructing a road segment between adjacent pixels is determined by a user supplied weight raster and a weight function; options include the average of adjacent weight raster values, and a function of the elevation differences between adjacent cells that penalizes steep grades. These road network projection methods are intended for integration into R workflows and modelling frameworks used for forecasting forest change, and can be applied over multiple time-steps without rebuilding a graph at each time-step.
| Version: | 1.2.0 |
| Depends: | R (≥ 2.10) |
| Imports: | dplyr,igraph (≥ 2.0.3),data.table,sf,units,rlang, methods,tidyselect,terra |
| Suggests: | testthat (≥ 2.1.0),knitr,rmarkdown,viridis,tmap,bench,gdistance |
| Published: | 2024-06-27 |
| DOI: | 10.32614/CRAN.package.roads |
| Author: | Sarah Endicott |
| Maintainer: | Sarah Endicott <sarah.endicott at ec.gc.ca> |
| BugReports: | https://github.com/LandSciTech/roads/issues |
| License: | Apache License (≥ 2) |
| URL: | https://github.com/LandSciTech/roads,https://landscitech.github.io/roads/ |
| NeedsCompilation: | no |
| Materials: | README,NEWS |
| CRAN checks: | roads results |
| Reference manual: | roads.html ,roads.pdf |
| Vignettes: | ReconstructRoadHistory (source,R code) Using the grade penalty function (source,R code) roads Package (source,R code) |
| Package source: | roads_1.2.0.tar.gz |
| Windows binaries: | r-devel:roads_1.2.0.zip, r-release:roads_1.2.0.zip, r-oldrel:roads_1.2.0.zip |
| macOS binaries: | r-release (arm64):roads_1.2.0.tgz, r-oldrel (arm64):roads_1.2.0.tgz, r-release (x86_64):roads_1.2.0.tgz, r-oldrel (x86_64):roads_1.2.0.tgz |
| Old sources: | roads archive |
Please use the canonical formhttps://CRAN.R-project.org/package=roadsto link to this page.