Description Usage Arguments Details Value References Examples
Simulates a midpoint displacement neutral landscape model.
1 2 3 4 5 6 7 8 9 10 |
ncol |
[ |
nrow |
[ |
resolution |
[ |
roughness |
[ |
rand_dev |
[ |
torus |
[ |
rescale |
[ |
verbose |
[ |
The algorithm is a direct implementation of the midpoint displacement algorithm. It performs the following steps:
Initialization: Determine the smallest fit of
max(ncol, nrow)
in n^2 + 1 and assign value to n.
Setup matrix of size (n^2 + 1)*(n^2 + 1).
Afterwards, assign a random value to the four corners of the matrix.
Diamond Step: For each square in the matrix, assign the average of the four corner points plus a random value to the midpoint of that square.
Diamond Step: For each diamond in the matrix, assign the average of the four corner points plus a random value to the midpoint of that diamond.
At each iteration the roughness, an approximation to common Hurst exponent, is reduced.
RasterLayer
https://en.wikipedia.org/wiki/Diamond-square_algorithm
1 2 3 4 5 6 7 8 9 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.