roads-package {roads} | R Documentation |
roads: Road Network Projection
Description
Project road network development based on an existing road network, target locations to be connected by roads and a cost surface. Road projection methods include minimum spanning tree with least cost path (Kruskal's algorithm (1956) doi:10.2307/2033241), least cost path (Dijkstra's algorithm (1959) doi:10.1007/BF01386390) or snapping. These road network projection methods are ideal for use with land cover change projection models.
Author(s)
Maintainer: Sarah Endicott sarah.endicott@ec.gc.ca (ORCID)
Authors:
Kyle Lochhead Kyle.Lochhead@gov.bc.ca
Josie Hughes josie.hughes@ec.gc.ca
Patrick Kirby
Other contributors:
Her Majesty the Queen in Right of Canada as represented by the Minister of the Environment (Copyright holder for included functions buildSimList, getLandingsFromTarget, pathsToLines, plotRoads, projectRoads, rasterizeLine, rasterToLineSegments) [copyright holder]
Province of British Columbia (Copyright holder for included functions getGraph, lcpList, mstList, shortestPaths, getClosestRoad, buildSnapRoads) [copyright holder]
See Also
Useful links:
Report bugs at https://github.com/LandSciTech/roads/issues