Generate a cost-distance raster based on a set of starting points and a friction raster.
Generate a cost-distance raster based on a set of starting points and a friction raster. This is an implementation of the standard algorithm cited in the "previous work" section of [1].
1. Tomlin, Dana. "Propagating radial waves of travel cost in a grid." International Journal of Geographical Information Science 24.9 (2010): 1391-1413.
Friction tile; pixels are interpreted as "second per meter"
List of starting points as tuples
The maximum cost before pruning a path (in units of "seconds")
The resolution of the tiles (in units of "meters per pixel")
Compute a cost tile.
Compute a cost tile.
The friction tile
The tile that will contain the costs
The maximum cost before pruning a path (in units of "seconds")
The resolution of the tiles (in units of "meters per pixel")
A priority queue of Cost objects (a.k.a. candidate paths)
Called when a pixel on the edge of the tile is updated
Generate an empty double-valued array tile of the correct dimensions.
Generate an empty double-valued array tile of the correct dimensions.
The number of cols of the friction tile (and therefore the cost tile)
The number of rows of the frition tile and cost tiles
Generate a Queue suitable for working with a tile of the given dimensions.
Generate a Queue suitable for working with a tile of the given dimensions.
The number of columns of the friction tile
The number of rows of the friction tile
NOP EdgeCallback
Object housing various functions related to Cost-Distance computations.