Perform erosion n times.
Erode all chunks by amount.
The Planchon-Darboux algorithm for extracting drainage networks.
Algorithm for finding and connecting lakes. Assumes newh and downhill have
already been computed. When a lake’s value is negative, it is its own lake
root, and when it is 0, it is on the boundary of Ω.
Precompute the maximum slope at all points.
Compute the water flux at all chunks for multiple receivers, given a list of
chunk indices sorted by increasing height and weights for each receiver.
Algorithm for computing multi-receiver flow.
Draw rivers and assign them heights, widths, and velocities. Take some
liberties with the constant factors etc. in order to make it more likely
that we draw rivers at all.
Iterate through set neighbors of multi-receiver flow.