Updates

Updated flow accumulation from r.watershed using MFD, convergence=1.

Background and Justification

Optimal Route in 3D

 
Premise:
Several data-loggers in steep terrain; how can we visit all of them in the most efficient manner such that we traverse the least cumulative slope gradient? In a sense this is a traveling salesman style problem, with travel costs defined by slope gradient. The v.net.salesman module in GRASS can be used to compute the optimal route between data-loggers, given: 1) a network of lines connecting all points to be visited and 2) transferal of slope cost information to the network. An example approach is listed below. Note that due to a bug in v.net.salesman, we need to use one extra step-- details below.

Quantiles: blue < light blue < green < yellow < orange

D-inf. flow routing algorithm

• Read more

quintles of beam radiance [MJ/sq.m], blue (560 - 640), aqua (640 - 660), green (660 - 680), yellow (680 - 700), orange (700 - 760).

summit (brown), backslope (yellow), swale (green) landscape positions, estimated from mean curvature.

based on topographic survey by RTK GPS.