12 Commits

Author SHA1 Message Date
12c3394114 Express map size in Minetest nodes, not in river grid nodes
This introduces new parameters 'map_x_size' and 'map_z_size' that default to 15K
Deprecates 'grid_x_size' and 'grid_z_size'; if they are present, corresponding
values of 'map_x_size' and 'map_z_size' are automatically written in config files.
Also rework compatibility system to better compare versions,
and bump version to 1.0.2-dev1.
2022-01-18 17:58:51 +01:00
b374e8ee95 Create settings_default.json to store default values for settings
Move noise parameters to settings.lua
2022-01-18 15:21:14 +01:00
1ad8c96b8c Remove 'default' hard dependency 2022-01-17 23:20:34 +01:00
2f7098d752 Bump version (1.0.2) and add changelog 2022-01-10 12:44:33 +01:00
942a869b9f Minor fix in README 2022-01-10 12:32:38 +01:00
b3d79eaaf8 Added more comments in terrainlib_lua 2022-01-07 14:48:36 +01:00
68c19c3b94 terrainlib_lua: replaced space indents by tabs 2022-01-06 15:36:31 +01:00
417ce1bcbc Use builtin logging system and appropriate loglevels 2022-01-03 16:33:56 +01:00
c3a798933f Localize all global functions in load.lua and geometry.lua 2022-01-03 16:20:51 +01:00
0c98fc0881 Skip chunks that are fully higher than ground level 2022-01-03 16:18:48 +01:00
cb71f4400a Corrected mistake in settingtypes 2022-01-03 12:04:49 +01:00
f8f467ac3f Use local variables for math.* functions
and remove an unnecessary index calculation
2022-01-03 11:56:16 +01:00
18 changed files with 502 additions and 307 deletions

18
CHANGELOG.md Normal file
View File

@ -0,0 +1,18 @@
CHANGELOG
=========
## `v1.0.2` (2022-01-10)
- Use builtin logging system and appropriate loglevels
- Skip empty chunks, when generating high above ground (~20% speedup)
- Minor optimizations (turning global variables to local...)
## `v1.0.1` (2021-09-14)
- Automatically switch to `singlenode` mapgen at init time
## `v1.0` (2021-08-01)
- Rewritten pregen code (terrainlib) in pure Lua
- Optimized grid loading
- Load grid nodes on request by default
- Changed river width settings
- Added map size in settings
- Added logs

View File

@ -1,5 +1,5 @@
# Map Generator with Rivers # Map Generator with Rivers
`mapgen_rivers v1.0.1` by Gaël de Sailly. `mapgen_rivers v1.0.2` by Gaël de Sailly.
Semi-procedural map generator for Minetest 5.x. It aims to create realistic and nice-looking landscapes for the game, focused on river networks. It is based on algorithms modelling water flow and river erosion at a broad scale, similar to some used by researchers in Earth Sciences. It is taking some inspiration from [Fastscape](https://github.com/fastscape-lem/fastscape). Semi-procedural map generator for Minetest 5.x. It aims to create realistic and nice-looking landscapes for the game, focused on river networks. It is based on algorithms modelling water flow and river erosion at a broad scale, similar to some used by researchers in Earth Sciences. It is taking some inspiration from [Fastscape](https://github.com/fastscape-lem/fastscape).
@ -13,10 +13,11 @@ It used to be composed of a Python script doing pre-generation, and a Lua mod re
License: GNU LGPLv3.0 License: GNU LGPLv3.0
Code: Gaël de Sailly Code: Gaël de Sailly
Flow routing algorithm concept (in `terrainlib/rivermapper.lua`): Cordonnier, G., Bovy, B., & Braun, J. (2019). A versatile, linear complexity algorithm for flow routing in topographies with depressions. Earth Surface Dynamics, 7(2), 549-562. Flow routing algorithm concept (in `terrainlib/rivermapper.lua`): Cordonnier, G., Bovy, B., & Braun, J. (2019). A versatile, linear complexity algorithm for flow routing in topographies with depressions. Earth Surface Dynamics, 7(2), 549-562.
# Requirements # Requirements
Mod dependencies: `default` required, and [`biomegen`](https://github.com/Gael-de-Sailly/biomegen) optional (provides biome system). No required dependency, but [`biomegen`](https://gitlab.com/gaelysam/biomegen) recommended (provides biome system).
# Installation # Installation
This mod should be placed in the `mods/` directory of Minetest like any other mod. This mod should be placed in the `mods/` directory of Minetest like any other mod.

View File

@ -1,3 +1,21 @@
local function version_is_lower(v1, v2)
local d1, c1, d2, c2
while #v1 > 0 and #v2 > 0 do
d1, c1, v1 = v1:match("^(%d*)(%D*)(.*)$")
d2, c2, v2 = v2:match("^(%d*)(%D*)(.*)$")
d1 = tonumber(d1) or -1
d2 = tonumber(d2) or -1
if d1 ~= d2 then
return d1 < d2
end
if c1 ~= c2 then
return c1 < c2
end
end
return false
end
local function fix_min_catchment(settings, is_global) local function fix_min_catchment(settings, is_global)
local prefix = is_global and "mapgen_rivers_" or "" local prefix = is_global and "mapgen_rivers_" or ""
@ -21,6 +39,18 @@ local function fix_compatibility_minetest(settings)
if previous_version == "0.0" then if previous_version == "0.0" then
fix_min_catchment(settings, true) fix_min_catchment(settings, true)
end end
if version_is_lower(previous_version, "1.0.2-dev1") then
local blocksize = tonumber(settings:get("mapgen_rivers_blocksize") or 15)
local grid_x_size = tonumber(settings:get("mapgen_rivers_grid_x_size"))
if grid_x_size then
settings:set("mapgen_rivers_map_x_size", tostring(grid_x_size * blocksize))
end
local grid_z_size = tonumber(settings:get("mapgen_rivers_grid_z_size"))
if grid_z_size then
settings:set("mapgen_rivers_map_z_size", tostring(grid_z_size * blocksize))
end
end
end end
local function fix_compatibility_mapgen_rivers(settings) local function fix_compatibility_mapgen_rivers(settings)
@ -29,6 +59,18 @@ local function fix_compatibility_mapgen_rivers(settings)
if previous_version == "0.0" then if previous_version == "0.0" then
fix_min_catchment(settings, false) fix_min_catchment(settings, false)
end end
if version_is_lower(previous_version, "1.0.2-dev1") then
local blocksize = tonumber(settings:get("blocksize") or 15)
local grid_x_size = tonumber(settings:get("grid_x_size"))
if grid_x_size then
settings:set("map_x_size", tostring(grid_x_size * blocksize))
end
local grid_z_size = tonumber(settings:get("grid_z_size"))
if grid_z_size then
settings:set("map_z_size", tostring(grid_z_size * blocksize))
end
end
end end
return fix_compatibility_minetest, fix_compatibility_mapgen_rivers return fix_compatibility_minetest, fix_compatibility_mapgen_rivers

View File

@ -1,3 +1,6 @@
local sqrt, abs = math.sqrt, math.abs
local unpk = unpack
local function distance_to_segment(x1, y1, x2, y2, x, y) local function distance_to_segment(x1, y1, x2, y2, x, y)
-- get the distance between point (x,y) and segment (x1,y1)-(x2,y2) -- get the distance between point (x,y) and segment (x1,y1)-(x2,y2)
local a = (x1-x2)^2 + (y1-y2)^2 -- square of distance local a = (x1-x2)^2 + (y1-y2)^2 -- square of distance
@ -5,13 +8,13 @@ local function distance_to_segment(x1, y1, x2, y2, x, y)
local c = (x2-x)^2 + (y2-y)^2 local c = (x2-x)^2 + (y2-y)^2
if a + b < c then if a + b < c then
-- The closest point of the segment is the extremity 1 -- The closest point of the segment is the extremity 1
return math.sqrt(b) return sqrt(b)
elseif a + c < b then elseif a + c < b then
-- The closest point of the segment is the extremity 2 -- The closest point of the segment is the extremity 2
return math.sqrt(c) return sqrt(c)
else else
-- The closest point is on the segment -- The closest point is on the segment
return math.abs(x1 * (y2-y) + x2 * (y-y1) + x * (y1-y2)) / math.sqrt(a) return abs(x1 * (y2-y) + x2 * (y-y1) + x * (y1-y2)) / sqrt(a)
end end
end end
@ -19,8 +22,8 @@ local function transform_quadri(X, Y, x, y)
-- To index points in an irregular quadrilateral, giving x and y between 0 (one edge) and 1 (opposite edge) -- To index points in an irregular quadrilateral, giving x and y between 0 (one edge) and 1 (opposite edge)
-- X, Y 4-vectors giving the coordinates of the 4 vertices -- X, Y 4-vectors giving the coordinates of the 4 vertices
-- x, y position to index. -- x, y position to index.
local x1, x2, x3, x4 = unpack(X) local x1, x2, x3, x4 = unpk(X)
local y1, y2, y3, y4 = unpack(Y) local y1, y2, y3, y4 = unpk(Y)
-- Compare distance to 2 opposite edges, they give the X coordinate -- Compare distance to 2 opposite edges, they give the X coordinate
local d23 = distance_to_segment(x2,y2,x3,y3,x,y) local d23 = distance_to_segment(x2,y2,x3,y3,x,y)

View File

@ -8,6 +8,10 @@ local riverbed_slope = mapgen_rivers.settings.riverbed_slope * mapgen_rivers.set
local MAP_BOTTOM = -31000 local MAP_BOTTOM = -31000
-- Localize for performance
local floor, min, max = math.floor, math.min, math.max
local unpk = unpack
-- Linear interpolation -- Linear interpolation
local function interp(v00, v01, v11, v10, xf, zf) local function interp(v00, v01, v11, v10, xf, zf)
local v0 = v01*xf + v00*(1-xf) local v0 = v01*xf + v00*(1-xf)
@ -30,11 +34,11 @@ local function heightmaps(minp, maxp)
if poly then if poly then
local xf, zf = transform_quadri(poly.x, poly.z, x, z) local xf, zf = transform_quadri(poly.x, poly.z, x, z)
local i00, i01, i11, i10 = unpack(poly.i) local i00, i01, i11, i10 = unpk(poly.i)
-- Load river width on 4 edges and corners -- Load river width on 4 edges and corners
local r_west, r_north, r_east, r_south = unpack(poly.rivers) local r_west, r_north, r_east, r_south = unpk(poly.rivers)
local c_NW, c_NE, c_SE, c_SW = unpack(poly.river_corners) local c_NW, c_NE, c_SE, c_SW = unpk(poly.river_corners)
-- Calculate the depth factor for each edge and corner. -- Calculate the depth factor for each edge and corner.
-- Depth factor: -- Depth factor:
@ -64,10 +68,10 @@ local function heightmaps(minp, maxp)
-- Transform the coordinates to have xf and zf = 0 or 1 in rivers (to avoid rivers having lateral slope and to accomodate the surrounding smoothly) -- Transform the coordinates to have xf and zf = 0 or 1 in rivers (to avoid rivers having lateral slope and to accomodate the surrounding smoothly)
if imax == 0 then if imax == 0 then
local x0 = math.max(r_west, c_NW-zf, zf-c_SW) local x0 = max(r_west, c_NW-zf, zf-c_SW)
local x1 = math.min(r_east, c_NE+zf, c_SE-zf) local x1 = min(r_east, c_NE+zf, c_SE-zf)
local z0 = math.max(r_north, c_NW-xf, xf-c_NE) local z0 = max(r_north, c_NW-xf, xf-c_NE)
local z1 = math.min(r_south, c_SW+xf, c_SE-xf) local z1 = min(r_south, c_SW+xf, c_SE-xf)
xf = (xf-x0) / (x1-x0) xf = (xf-x0) / (x1-x0)
zf = (zf-z0) / (z1-z0) zf = (zf-z0) / (z1-z0)
elseif imax == 1 then elseif imax == 1 then
@ -90,7 +94,7 @@ local function heightmaps(minp, maxp)
-- Determine elevation by interpolation -- Determine elevation by interpolation
local vdem = poly.dem local vdem = poly.dem
local terrain_height = math.floor(0.5+interp( local terrain_height = floor(0.5+interp(
vdem[1], vdem[1],
vdem[2], vdem[2],
vdem[3], vdem[3],
@ -115,10 +119,10 @@ local function heightmaps(minp, maxp)
lake_id = 1 lake_id = 1
end end
end end
local lake_height = math.max(math.floor(poly.lake[lake_id]), terrain_height) local lake_height = max(floor(poly.lake[lake_id]), terrain_height)
if imax > 0 and depth_factor_max > 0 then if imax > 0 and depth_factor_max > 0 then
terrain_height = math.min(math.max(lake_height, sea_level) - math.floor(1+depth_factor_max*riverbed_slope), terrain_height) terrain_height = min(max(lake_height, sea_level) - floor(1+depth_factor_max*riverbed_slope), terrain_height)
end end
terrain_height_map[i] = terrain_height terrain_height_map[i] = terrain_height

View File

@ -6,7 +6,7 @@ mapgen_rivers.world_data_path = minetest.get_worldpath() .. '/river_data/'
if minetest.get_mapgen_setting("mg_name") ~= "singlenode" then if minetest.get_mapgen_setting("mg_name") ~= "singlenode" then
minetest.set_mapgen_setting("mg_name", "singlenode", true) minetest.set_mapgen_setting("mg_name", "singlenode", true)
print("[mapgen_rivers] Mapgen set to singlenode") minetest.log("warning", "[mapgen_rivers] Mapgen set to singlenode")
end end
dofile(modpath .. 'settings.lua') dofile(modpath .. 'settings.lua')
@ -16,12 +16,11 @@ local elevation_chill = mapgen_rivers.settings.elevation_chill
local use_distort = mapgen_rivers.settings.distort local use_distort = mapgen_rivers.settings.distort
local use_biomes = mapgen_rivers.settings.biomes local use_biomes = mapgen_rivers.settings.biomes
local use_biomegen_mod = use_biomes and minetest.global_exists('biomegen') local use_biomegen_mod = use_biomes and minetest.global_exists('biomegen')
use_biomes = use_biomes and not use_biomegen_mod use_biomes = use_biomes and minetest.global_exists('default') and not use_biomegen_mod
if use_biomegen_mod then if use_biomegen_mod then
biomegen.set_elevation_chill(elevation_chill) biomegen.set_elevation_chill(elevation_chill)
end end
dofile(modpath .. 'noises.lua')
local heightmaps = dofile(modpath .. 'heightmap.lua') local heightmaps = dofile(modpath .. 'heightmap.lua')
@ -32,6 +31,9 @@ local function interp(v00, v01, v11, v10, xf, zf)
return v1*zf + v0*(1-zf) return v1*zf + v0*(1-zf)
end end
-- Localize for performance
local floor, min = math.floor, math.min
local data = {} local data = {}
local noise_x_obj, noise_z_obj, noise_distort_obj, noise_heat_obj, noise_heat_blend_obj local noise_x_obj, noise_z_obj, noise_distort_obj, noise_heat_obj, noise_heat_blend_obj
@ -48,7 +50,7 @@ local sumtime2 = 0
local ngen = 0 local ngen = 0
local function generate(minp, maxp, seed) local function generate(minp, maxp, seed)
print(("[mapgen_rivers] Generating from %s to %s"):format(minetest.pos_to_string(minp), minetest.pos_to_string(maxp))) minetest.log("info", ("[mapgen_rivers] Generating from %s to %s"):format(minetest.pos_to_string(minp), minetest.pos_to_string(maxp)))
local chulens = { local chulens = {
x = maxp.x-minp.x+1, x = maxp.x-minp.x+1,
@ -111,8 +113,8 @@ local function generate(minp, maxp, seed)
end end
end end
local pminp = {x=math.floor(xmin), z=math.floor(zmin)} local pminp = {x=floor(xmin), z=floor(zmin)}
local pmaxp = {x=math.floor(xmax)+1, z=math.floor(zmax)+1} local pmaxp = {x=floor(xmax)+1, z=floor(zmax)+1}
incr = pmaxp.x-pminp.x+1 incr = pmaxp.x-pminp.x+1
i_origin = 1 - pminp.z*incr - pminp.x i_origin = 1 - pminp.z*incr - pminp.x
terrain_map, lake_map = heightmaps(pminp, pmaxp) terrain_map, lake_map = heightmaps(pminp, pmaxp)
@ -120,15 +122,43 @@ local function generate(minp, maxp, seed)
terrain_map, lake_map = heightmaps(minp, maxp) terrain_map, lake_map = heightmaps(minp, maxp)
end end
local c_stone = minetest.get_content_id("default:stone") -- Check that there is at least one position that reaches min y
local c_dirt = minetest.get_content_id("default:dirt") if minp.y > sea_level then
local c_lawn = minetest.get_content_id("default:dirt_with_grass") local y0 = minp.y
local c_dirtsnow = minetest.get_content_id("default:dirt_with_snow") local is_empty = true
local c_snow = minetest.get_content_id("default:snowblock") for i=1, #terrain_map do
local c_sand = minetest.get_content_id("default:sand") if terrain_map[i] >= y0 or lake_map[i] >= y0 then
local c_water = minetest.get_content_id("default:water_source") is_empty = false
local c_rwater = minetest.get_content_id("default:river_water_source") break
local c_ice = minetest.get_content_id("default:ice") end
end
-- If not, skip chunk
if is_empty then
local t = os.clock() - t0
ngen = ngen + 1
sumtime = sumtime + t
sumtime2 = sumtime2 + t*t
minetest.log("verbose", "[mapgen_rivers] Skipping empty chunk (fully above ground level)")
minetest.log("verbose", ("[mapgen_rivers] Done in %5.3f s"):format(t))
return
end
end
local c_stone = minetest.get_content_id("mapgen_stone")
local c_water = minetest.get_content_id("mapgen_water_source")
local c_rwater = minetest.get_content_id("mapgen_river_water_source")
local c_dirt, c_lawn, c_dirtsnow, c_snow, c_sand, c_ice
if use_biomes then
c_dirt = minetest.get_content_id("default:dirt")
c_lawn = minetest.get_content_id("default:dirt_with_grass")
c_dirtsnow = minetest.get_content_id("default:dirt_with_snow")
c_snow = minetest.get_content_id("default:snowblock")
c_sand = minetest.get_content_id("default:sand")
c_ice = minetest.get_content_id("default:ice")
end
local vm, emin, emax = minetest.get_mapgen_object("voxelmanip") local vm, emin, emax = minetest.get_mapgen_object("voxelmanip")
vm:get_data(data) vm:get_data(data)
@ -145,7 +175,7 @@ local function generate(minp, maxp, seed)
for z = minp.z, maxp.z do for z = minp.z, maxp.z do
for x = minp.x, maxp.x do for x = minp.x, maxp.x do
local ivm = a:index(x, minp.y, z) local ivm = a:index(x, maxp.y+1, z)
local ground_above = false local ground_above = false
local temperature local temperature
if use_biomes then if use_biomes then
@ -161,8 +191,8 @@ local function generate(minp, maxp, seed)
if use_distort then if use_distort then
local xn = noise_x_map[nid] local xn = noise_x_map[nid]
local zn = noise_z_map[nid] local zn = noise_z_map[nid]
local x0 = math.floor(xn) local x0 = floor(xn)
local z0 = math.floor(zn) local z0 = floor(zn)
local i0 = i_origin + z0*incr + x0 local i0 = i_origin + z0*incr + x0
local i1 = i0+1 local i1 = i0+1
@ -170,13 +200,12 @@ local function generate(minp, maxp, seed)
local i3 = i2-1 local i3 = i2-1
terrain = interp(terrain_map[i0], terrain_map[i1], terrain_map[i2], terrain_map[i3], xn-x0, zn-z0) terrain = interp(terrain_map[i0], terrain_map[i1], terrain_map[i2], terrain_map[i3], xn-x0, zn-z0)
lake = math.min(lake_map[i0], lake_map[i1], lake_map[i2], lake_map[i3]) lake = min(lake_map[i0], lake_map[i1], lake_map[i2], lake_map[i3])
end end
if y <= maxp.y then if y <= maxp.y then
local is_lake = lake > terrain local is_lake = lake > terrain
local ivm = a:index(x, y, z)
if y <= terrain then if y <= terrain then
if not use_biomes or y <= terrain-1 or ground_above then if not use_biomes or y <= terrain-1 or ground_above then
data[ivm] = c_stone data[ivm] = c_stone
@ -205,7 +234,7 @@ local function generate(minp, maxp, seed)
ground_above = y <= terrain ground_above = y <= terrain
ivm = ivm + ystride ivm = ivm - ystride
if use_distort then if use_distort then
nid = nid + incrY nid = nid + incrY
end end
@ -233,18 +262,17 @@ local function generate(minp, maxp, seed)
vm:calc_lighting() vm:calc_lighting()
vm:update_liquids() vm:update_liquids()
vm:write_to_map() vm:write_to_map()
local t1 = os.clock()
local t = t1-t0 local t = os.clock()-t0
ngen = ngen + 1 ngen = ngen + 1
sumtime = sumtime + t sumtime = sumtime + t
sumtime2 = sumtime2 + t*t sumtime2 = sumtime2 + t*t
print(("[mapgen_rivers] Done in %5.3f s"):format(t)) minetest.log("verbose", ("[mapgen_rivers] Done in %5.3f s"):format(t))
end end
minetest.register_on_generated(generate) minetest.register_on_generated(generate)
minetest.register_on_shutdown(function() minetest.register_on_shutdown(function()
local avg = sumtime / ngen local avg = sumtime / ngen
local std = math.sqrt(sumtime2/ngen - avg*avg) local std = math.sqrt(sumtime2/ngen - avg*avg)
print(("[mapgen_rivers] Mapgen statistics:\n- Mapgen calls: %4d\n- Mean time: %5.3f s\n- Standard deviation: %5.3f s"):format(ngen, avg, std)) minetest.log("action", ("[mapgen_rivers] Mapgen statistics:\n- Mapgen calls: %4d\n- Mean time: %5.3f s\n- Standard deviation: %5.3f s"):format(ngen, avg, std))
end) end)

View File

@ -1,12 +1,15 @@
local worldpath = mapgen_rivers.world_data_path local worldpath = mapgen_rivers.world_data_path
local floor = math.floor
local sbyte, schar = string.byte, string.char
local unpk = unpack
function mapgen_rivers.load_map(filename, bytes, signed, size, converter) function mapgen_rivers.load_map(filename, bytes, signed, size, converter)
local file = io.open(worldpath .. filename, 'rb') local file = io.open(worldpath .. filename, 'rb')
local data = file:read('*all') local data = file:read('*all')
if #data < bytes*size then if #data < bytes*size then
data = minetest.decompress(data) data = minetest.decompress(data)
end end
local sbyte = string.byte
local map = {} local map = {}
@ -35,8 +38,6 @@ function mapgen_rivers.load_map(filename, bytes, signed, size, converter)
return map return map
end end
local sbyte = string.byte
local loader_mt = { local loader_mt = {
__index = function(loader, i) __index = function(loader, i)
local file = loader.file local file = loader.file
@ -75,9 +76,6 @@ end
function mapgen_rivers.write_map(filename, data, bytes) function mapgen_rivers.write_map(filename, data, bytes)
local size = #data local size = #data
local file = io.open(worldpath .. filename, 'wb') local file = io.open(worldpath .. filename, 'wb')
local mfloor = math.floor
local schar = string.char
local upack = unpack
local bytelist = {} local bytelist = {}
for j=1, bytes do for j=1, bytes do
@ -85,15 +83,15 @@ function mapgen_rivers.write_map(filename, data, bytes)
end end
for i=1, size do for i=1, size do
local n = mfloor(data[i]) local n = floor(data[i])
data[i] = n data[i] = n
for j=bytes, 2, -1 do for j=bytes, 2, -1 do
bytelist[j] = n % 256 bytelist[j] = n % 256
n = mfloor(n / 256) n = floor(n / 256)
end end
bytelist[1] = n % 256 bytelist[1] = n % 256
file:write(schar(upack(bytelist))) file:write(schar(unpk(bytelist)))
end end
file:close() file:close()

View File

@ -1,4 +1,3 @@
name = mapgen_rivers name = mapgen_rivers
title = Map generator with realistic rivers title = Map generator with realistic rivers
depends = default optional_depends = biomegen, default
optional_depends = biomegen

View File

@ -1,80 +0,0 @@
local def_setting = mapgen_rivers.define_setting
mapgen_rivers.noise_params = {
base = def_setting('np_base', 'noise', {
offset = 0,
scale = 300,
seed = 2469,
octaves = 8,
spread = {x=2048, y=2048, z=2048},
persist = 0.6,
lacunarity = 2,
flags = "eased",
}),
distort_x = def_setting('np_distort_x', 'noise', {
offset = 0,
scale = 1,
seed = -4574,
spread = {x=64, y=32, z=64},
octaves = 3,
persistence = 0.75,
lacunarity = 2,
}),
distort_z = def_setting('np_distort_z', 'noise', {
offset = 0,
scale = 1,
seed = -7940,
spread = {x=64, y=32, z=64},
octaves = 3,
persistence = 0.75,
lacunarity = 2,
}),
distort_amplitude = def_setting('np_distort_amplitude', 'noise', {
offset = 0,
scale = 10,
seed = 676,
spread = {x=1024, y=1024, z=1024},
octaves = 5,
persistence = 0.5,
lacunarity = 2,
flags = "absvalue",
}),
heat = minetest.get_mapgen_setting_noiseparams('mg_biome_np_heat'),
heat_blend = minetest.get_mapgen_setting_noiseparams('mg_biome_np_heat_blend'),
}
-- Convert to number because Minetest API is not able to do it cleanly...
for name, np in pairs(mapgen_rivers.noise_params) do
for field, value in pairs(np) do
if field ~= 'flags' and type(value) == 'string' then
np[field] = tonumber(value) or value
elseif field == 'spread' then
for dir, v in pairs(value) do
value[dir] = tonumber(v) or v
end
end
end
end
local heat = mapgen_rivers.noise_params.heat
local base = mapgen_rivers.noise_params.base
local settings = mapgen_rivers.settings
heat.offset = heat.offset + settings.sea_level * settings.elevation_chill
base.spread.x = base.spread.x / settings.blocksize
base.spread.y = base.spread.y / settings.blocksize
base.spread.z = base.spread.z / settings.blocksize
for name, np in pairs(mapgen_rivers.noise_params) do
local lac = np.lacunarity or 2
if lac > 1 then
local omax = math.floor(math.log(math.min(np.spread.x, np.spread.y, np.spread.z)) / math.log(lac))+1
if np.octaves > omax then
print("[mapgen_rivers] Noise " .. name .. ": 'octaves' reduced to " .. omax)
np.octaves = omax
end
end
end

View File

@ -11,8 +11,9 @@ dofile(modpath .. 'load.lua')
mapgen_rivers.grid = {} mapgen_rivers.grid = {}
local X = mapgen_rivers.settings.grid_x_size local blocksize = mapgen_rivers.settings.blocksize
local Z = mapgen_rivers.settings.grid_z_size local X = math.floor(mapgen_rivers.settings.map_x_size / blocksize)
local Z = math.floor(mapgen_rivers.settings.map_z_size / blocksize)
local function offset_converter(o) local function offset_converter(o)
return (o + 0.5) * (1/256) return (o + 0.5) * (1/256)
@ -33,7 +34,7 @@ if first_mapgen then
-- Generate a map!! -- Generate a map!!
local pregenerate = dofile(mapgen_rivers.modpath .. '/pregenerate.lua') local pregenerate = dofile(mapgen_rivers.modpath .. '/pregenerate.lua')
minetest.register_on_mods_loaded(function() minetest.register_on_mods_loaded(function()
print('[mapgen_rivers] Generating grid') minetest.log("action", '[mapgen_rivers] Generating grid, this may take a while...')
pregenerate(load_all) pregenerate(load_all)
if load_all then if load_all then
@ -58,9 +59,9 @@ if not (first_mapgen and load_all) then
minetest.register_on_mods_loaded(function() minetest.register_on_mods_loaded(function()
if load_all then if load_all then
print('[mapgen_rivers] Loading full grid') minetest.log("action", '[mapgen_rivers] Loading full grid')
else else
print('[mapgen_rivers] Loading grid as interactive loaders') minetest.log("action", '[mapgen_rivers] Loading grid as interactive loaders')
end end
local grid = mapgen_rivers.grid local grid = mapgen_rivers.grid
@ -80,7 +81,6 @@ local function index(x, z)
return z*X+x+1 return z*X+x+1
end end
local blocksize = mapgen_rivers.settings.blocksize
local min_catchment = mapgen_rivers.settings.min_catchment local min_catchment = mapgen_rivers.settings.min_catchment
local max_catchment = mapgen_rivers.settings.max_catchment local max_catchment = mapgen_rivers.settings.max_catchment
@ -90,16 +90,19 @@ if mapgen_rivers.settings.center then
map_offset.z = blocksize*Z/2 map_offset.z = blocksize*Z/2
end end
-- Localize for performance
local floor, ceil, min, max, abs = math.floor, math.ceil, math.min, math.max, math.abs
local min_catchment = mapgen_rivers.settings.min_catchment / (blocksize*blocksize) local min_catchment = mapgen_rivers.settings.min_catchment / (blocksize*blocksize)
local wpower = mapgen_rivers.settings.river_widening_power local wpower = mapgen_rivers.settings.river_widening_power
local wfactor = 1/(2*blocksize * min_catchment^wpower) local wfactor = 1/(2*blocksize * min_catchment^wpower)
local function river_width(flow) local function river_width(flow)
flow = math.abs(flow) flow = abs(flow)
if flow < min_catchment then if flow < min_catchment then
return 0 return 0
end end
return math.min(wfactor * flow ^ wpower, 1) return min(wfactor * flow ^ wpower, 1)
end end
local noise_heat -- Need a large-scale noise here so no heat blend local noise_heat -- Need a large-scale noise here so no heat blend
@ -138,8 +141,8 @@ local function make_polygons(minp, maxp)
local polygons = {} local polygons = {}
-- Determine the minimum and maximum coordinates of the polygons that could be on the chunk, knowing that they have an average size of 'blocksize' and a maximal offset of 0.5 blocksize. -- Determine the minimum and maximum coordinates of the polygons that could be on the chunk, knowing that they have an average size of 'blocksize' and a maximal offset of 0.5 blocksize.
local xpmin, xpmax = math.max(math.floor((minp.x+map_offset.x)/blocksize - 0.5), 0), math.min(math.ceil((maxp.x+map_offset.x)/blocksize + 0.5), X-2) local xpmin, xpmax = max(floor((minp.x+map_offset.x)/blocksize - 0.5), 0), min(ceil((maxp.x+map_offset.x)/blocksize + 0.5), X-2)
local zpmin, zpmax = math.max(math.floor((minp.z+map_offset.z)/blocksize - 0.5), 0), math.min(math.ceil((maxp.z+map_offset.z)/blocksize + 0.5), Z-2) local zpmin, zpmax = max(floor((minp.z+map_offset.z)/blocksize - 0.5), 0), min(ceil((maxp.z+map_offset.z)/blocksize + 0.5), Z-2)
-- Iterate over the polygons -- Iterate over the polygons
for xp = xpmin, xpmax do for xp = xpmin, xpmax do
@ -165,8 +168,8 @@ local function make_polygons(minp, maxp)
local bounds = {} -- Will be a list of the intercepts of polygon edges for every Z position (scanline algorithm) local bounds = {} -- Will be a list of the intercepts of polygon edges for every Z position (scanline algorithm)
-- Calculate the min and max Z positions -- Calculate the min and max Z positions
local zmin = math.max(math.floor(math.min(unpack(poly_z)))+1, minp.z) local zmin = max(floor(min(unpack(poly_z)))+1, minp.z)
local zmax = math.min(math.floor(math.max(unpack(poly_z))), maxp.z) local zmax = min(floor(max(unpack(poly_z))), maxp.z)
-- And initialize the arrays -- And initialize the arrays
for z=zmin, zmax do for z=zmin, zmax do
bounds[z] = {} bounds[z] = {}
@ -176,14 +179,14 @@ local function make_polygons(minp, maxp)
for i2=1, 4 do -- Loop on 4 edges for i2=1, 4 do -- Loop on 4 edges
local z1, z2 = poly_z[i1], poly_z[i2] local z1, z2 = poly_z[i1], poly_z[i2]
-- Calculate the integer Z positions over which this edge spans -- Calculate the integer Z positions over which this edge spans
local lzmin = math.floor(math.min(z1, z2))+1 local lzmin = floor(min(z1, z2))+1
local lzmax = math.floor(math.max(z1, z2)) local lzmax = floor(max(z1, z2))
if lzmin <= lzmax then -- If there is at least one position in it if lzmin <= lzmax then -- If there is at least one position in it
local x1, x2 = poly_x[i1], poly_x[i2] local x1, x2 = poly_x[i1], poly_x[i2]
-- Calculate coefficient of the equation defining the edge: X=aZ+b -- Calculate coefficient of the equation defining the edge: X=aZ+b
local a = (x1-x2) / (z1-z2) local a = (x1-x2) / (z1-z2)
local b = (x1 - a*z1) local b = (x1 - a*z1)
for z=math.max(lzmin, minp.z), math.min(lzmax, maxp.z) do for z=max(lzmin, minp.z), min(lzmax, maxp.z) do
-- For every Z position involved, add the intercepted X position in the table -- For every Z position involved, add the intercepted X position in the table
table.insert(bounds[z], a*z+b) table.insert(bounds[z], a*z+b)
end end
@ -194,11 +197,11 @@ local function make_polygons(minp, maxp)
-- Now sort the bounds list -- Now sort the bounds list
local zlist = bounds[z] local zlist = bounds[z]
table.sort(zlist) table.sort(zlist)
local c = math.floor(#zlist/2) local c = floor(#zlist/2)
for l=1, c do for l=1, c do
-- Take pairs of X coordinates: all positions between them belong to the polygon. -- Take pairs of X coordinates: all positions between them belong to the polygon.
local xmin = math.max(math.floor(zlist[l*2-1])+1, minp.x) local xmin = max(floor(zlist[l*2-1])+1, minp.x)
local xmax = math.min(math.floor(zlist[l*2]), maxp.x) local xmax = min(floor(zlist[l*2]), maxp.x)
local i = (z-minp.z) * chulens + (xmin-minp.x) + 1 local i = (z-minp.z) * chulens + (xmin-minp.x) + 1
for x=xmin, xmax do for x=xmin, xmax do
-- Fill the map at these places -- Fill the map at these places
@ -220,16 +223,16 @@ local function make_polygons(minp, maxp)
local riverD = river_width(rivers[iD]) local riverD = river_width(rivers[iD])
if glaciers then -- Widen the river if glaciers then -- Widen the river
if get_temperature(poly_x[1], poly_dem[1], poly_z[1]) < 0 then if get_temperature(poly_x[1], poly_dem[1], poly_z[1]) < 0 then
riverA = math.min(riverA*glacier_factor, 1) riverA = min(riverA*glacier_factor, 1)
end end
if get_temperature(poly_x[2], poly_dem[2], poly_z[2]) < 0 then if get_temperature(poly_x[2], poly_dem[2], poly_z[2]) < 0 then
riverB = math.min(riverB*glacier_factor, 1) riverB = min(riverB*glacier_factor, 1)
end end
if get_temperature(poly_x[3], poly_dem[3], poly_z[3]) < 0 then if get_temperature(poly_x[3], poly_dem[3], poly_z[3]) < 0 then
riverC = math.min(riverC*glacier_factor, 1) riverC = min(riverC*glacier_factor, 1)
end end
if get_temperature(poly_x[4], poly_dem[4], poly_z[4]) < 0 then if get_temperature(poly_x[4], poly_dem[4], poly_z[4]) < 0 then
riverD = math.min(riverD*glacier_factor, 1) riverD = min(riverD*glacier_factor, 1)
end end
end end

View File

@ -5,6 +5,7 @@ local blocksize = mapgen_rivers.settings.blocksize
local tectonic_speed = mapgen_rivers.settings.tectonic_speed local tectonic_speed = mapgen_rivers.settings.tectonic_speed
local np_base = table.copy(mapgen_rivers.noise_params.base) local np_base = table.copy(mapgen_rivers.noise_params.base)
np_base.spread = vector.divide(np_base.spread, blocksize)
local evol_params = mapgen_rivers.settings.evol_params local evol_params = mapgen_rivers.settings.evol_params
@ -17,6 +18,10 @@ local function pregenerate(keep_loaded)
local grid = mapgen_rivers.grid local grid = mapgen_rivers.grid
local size = grid.size local size = grid.size
if size.x * size.y > 4e6 then
minetest.log("warning", "[mapgen_rivers] You are going to generate a very large grid (>4M nodes). If you experience problems, you should increase blocksize or reduce map size.")
end
local seed = tonumber(minetest.get_mapgen_setting("seed")) local seed = tonumber(minetest.get_mapgen_setting("seed"))
np_base.seed = (np_base.seed or 0) + seed np_base.seed = (np_base.seed or 0) + seed
@ -33,7 +38,7 @@ local function pregenerate(keep_loaded)
local tectonic_step = tectonic_speed * time_step local tectonic_step = tectonic_speed * time_step
collectgarbage() collectgarbage()
for i=1, niter do for i=1, niter do
print("[mapgen_rivers] Iteration " .. i .. " of " .. niter) minetest.log("info", "[mapgen_rivers] Iteration " .. i .. " of " .. niter)
model:diffuse(time_step) model:diffuse(time_step)
model:flow() model:flow()

View File

@ -1,7 +1,7 @@
local mtsettings = minetest.settings local mtsettings = minetest.settings
local mgrsettings = Settings(minetest.get_worldpath() .. '/mapgen_rivers.conf') local mgrsettings = Settings(minetest.get_worldpath() .. '/mapgen_rivers.conf')
mapgen_rivers.version = "1.0.1" mapgen_rivers.version = "1.0.2-dev1"
local previous_version_mt = mtsettings:get("mapgen_rivers_version") or "0.0" local previous_version_mt = mtsettings:get("mapgen_rivers_version") or "0.0"
local previous_version_mgr = mgrsettings:get("version") or "0.0" local previous_version_mgr = mgrsettings:get("version") or "0.0"
@ -19,13 +19,33 @@ end
mtsettings:set("mapgen_rivers_version", mapgen_rivers.version) mtsettings:set("mapgen_rivers_version", mapgen_rivers.version)
mgrsettings:set("version", mapgen_rivers.version) mgrsettings:set("version", mapgen_rivers.version)
local defaults
do
local f = io.open(mapgen_rivers.modpath .. "/settings_default.json")
defaults = minetest.parse_json(f:read("*all"))
f:close()
end
-- Convert strings to numbers in noise params because Minetest API is not able to do it cleanly...
local function clean_np(np)
for field, value in pairs(np) do
if field ~= 'flags' and type(value) == 'string' then
np[field] = tonumber(value) or value
elseif field == 'spread' then
for dir, v in pairs(value) do
value[dir] = tonumber(v) or v
end
end
end
end
function mapgen_rivers.define_setting(name, dtype, default) function mapgen_rivers.define_setting(name, dtype, default)
if dtype == "number" or dtype == "string" then if dtype == "number" or dtype == "string" then
local v = mgrsettings:get(name) local v = mgrsettings:get(name)
if v == nil then if v == nil then
v = mtsettings:get('mapgen_rivers_' .. name) v = mtsettings:get('mapgen_rivers_' .. name)
if v == nil then if v == nil then
v = default v = defaults[name]
end end
mgrsettings:set(name, v) mgrsettings:set(name, v)
end end
@ -39,7 +59,7 @@ function mapgen_rivers.define_setting(name, dtype, default)
if v == nil then if v == nil then
v = mtsettings:get_bool('mapgen_rivers_' .. name) v = mtsettings:get_bool('mapgen_rivers_' .. name)
if v == nil then if v == nil then
v = default v = defaults[name]
end end
mgrsettings:set_bool(name, v) mgrsettings:set_bool(name, v)
end end
@ -49,10 +69,11 @@ function mapgen_rivers.define_setting(name, dtype, default)
if v == nil then if v == nil then
v = mtsettings:get_np_group('mapgen_rivers_' .. name) v = mtsettings:get_np_group('mapgen_rivers_' .. name)
if v == nil then if v == nil then
v = default v = defaults[name]
end end
mgrsettings:set_np_group(name, v) mgrsettings:set_np_group(name, v)
end end
clean_np(v)
return v return v
end end
end end
@ -60,33 +81,46 @@ end
local def_setting = mapgen_rivers.define_setting local def_setting = mapgen_rivers.define_setting
mapgen_rivers.settings = { mapgen_rivers.settings = {
center = def_setting('center', 'bool', true), center = def_setting('center', 'bool'),
blocksize = def_setting('blocksize', 'number', 15), blocksize = def_setting('blocksize', 'number'),
sea_level = tonumber(minetest.get_mapgen_setting('water_level')), sea_level = tonumber(minetest.get_mapgen_setting('water_level')),
min_catchment = def_setting('min_catchment', 'number', 3600), min_catchment = def_setting('min_catchment', 'number'),
river_widening_power = def_setting('river_widening_power', 'number', 0.5), river_widening_power = def_setting('river_widening_power', 'number'),
riverbed_slope = def_setting('riverbed_slope', 'number', 0.4), riverbed_slope = def_setting('riverbed_slope', 'number'),
distort = def_setting('distort', 'bool', true), distort = def_setting('distort', 'bool'),
biomes = def_setting('biomes', 'bool', true), biomes = def_setting('biomes', 'bool'),
glaciers = def_setting('glaciers', 'bool', false), glaciers = def_setting('glaciers', 'bool'),
glacier_factor = def_setting('glacier_factor', 'number', 8), glacier_factor = def_setting('glacier_factor', 'number'),
elevation_chill = def_setting('elevation_chill', 'number', 0.25), elevation_chill = def_setting('elevation_chill', 'number'),
grid_x_size = def_setting('grid_x_size', 'number', 1000), map_x_size = def_setting('map_x_size', 'number'),
grid_z_size = def_setting('grid_z_size', 'number', 1000), map_z_size = def_setting('map_z_size', 'number'),
evol_params = { evol_params = {
K = def_setting('river_erosion_coef', 'number', 0.5), K = def_setting('river_erosion_coef', 'number'),
m = def_setting('river_erosion_power', 'number', 0.4), m = def_setting('river_erosion_power', 'number'),
d = def_setting('diffusive_erosion', 'number', 0.5), d = def_setting('diffusive_erosion', 'number'),
compensation_radius = def_setting('compensation_radius', 'number', 50), compensation_radius = def_setting('compensation_radius', 'number'),
}, },
tectonic_speed = def_setting('tectonic_speed', 'number', 70), tectonic_speed = def_setting('tectonic_speed', 'number'),
evol_time = def_setting('evol_time', 'number', 10), evol_time = def_setting('evol_time', 'number'),
evol_time_step = def_setting('evol_time_step', 'number', 1), evol_time_step = def_setting('evol_time_step', 'number'),
load_all = mtsettings:get_bool('mapgen_rivers_load_all') load_all = mtsettings:get_bool('mapgen_rivers_load_all')
} }
mapgen_rivers.noise_params = {
base = def_setting("np_base", "noise"),
distort_x = def_setting("np_distort_x", "noise"),
distort_z = def_setting("np_distort_z", "noise"),
distort_amplitude = def_setting("np_distort_amplitude", "noise"),
heat = minetest.get_mapgen_setting_noiseparams('mg_biome_np_heat'),
heat_blend = minetest.get_mapgen_setting_noiseparams('mg_biome_np_heat_blend'),
}
mapgen_rivers.noise_params.heat.offset = mapgen_rivers.noise_params.heat.offset +
mapgen_rivers.settings.sea_level * mapgen_rivers.settings.elevation_chill
local function write_settings() local function write_settings()
mgrsettings:write() mgrsettings:write()
end end

68
settings_default.json Normal file
View File

@ -0,0 +1,68 @@
{
"version": "1.0.2",
"center": true,
"water_level": 1,
"blocksize": 15,
"min_catchment": 3600,
"river_widening_power": 0.5,
"riverbed_slope": 0.4,
"distort": true,
"biomes": true,
"glaciers": false,
"glacier_factor": 8,
"elevation_chill": 0.25,
"map_x_size": 15000,
"map_z_size": 15000,
"river_erosion_coef": 0.5,
"river_erosion_power": 0.4,
"diffusive_erosion": 0.5,
"compensation_radius": 50,
"tectonic_speed": 70,
"evol_time": 10,
"evol_time_step": 1,
"load_all": false,
"np_base": {
"offset": 0,
"scale": 300,
"seed": 2469,
"octaves": 8,
"spread": {"x": 2048, "y": 2048, "z": 2048},
"persist": 0.6,
"lacunarity": 2.0,
"flags": "eased"
},
"np_distort_x": {
"offset": 0,
"scale": 1,
"seed": -4574,
"octaves": 3,
"spread": {"x": 64, "y": 32, "z": 64},
"persist": 0.75,
"lacunarity": 2.0
},
"np_distort_z": {
"offset": 0,
"scale": 1,
"seed": -7940,
"octaves": 3,
"spread": {"x": 64, "y": 32, "z": 64},
"persist": 0.75,
"lacunarity": 2.0
},
"np_distort_amplitude": {
"offset": 0,
"scale": 10,
"seed": 676,
"octaves": 5,
"spread": {"x": 1024, "y": 1024, "z": 1024},
"persist": 0.5,
"lacunarity": 2.0,
"flags": "absvalue"
}
}

View File

@ -3,19 +3,25 @@
# Whether the map should be centered at x=0, z=0. # Whether the map should be centered at x=0, z=0.
mapgen_rivers_center (Center map) bool true mapgen_rivers_center (Center map) bool true
# Represents horizontal map scale. Every cell of the grid will be upscaled to # Every cell of the river grid will represent a square of this size.
# a square of this size. # A lower value will result in more detailed terrain and finer computation
# For example if the grid size is 1000x1000 and block size is 12, # of rivers, but will be slower to generate and use more resources.
# the actual size of the map will be 12000. #
# WARNING: Excessively low values may cause crashes at pre-generation, due to
# memory issues
mapgen_rivers_blocksize (Block size) float 15.0 2.0 100.0 mapgen_rivers_blocksize (Block size) float 15.0 2.0 100.0
# X size of the grid being generated # X size of the map being generated
# Actual size of the map is grid_x_size * blocksize #
mapgen_rivers_grid_x_size (Grid X size) int 1000 50 5000 # X size of the river grid will be this/blocksize
# When increasing, it is recommended to increase blocksize too
mapgen_rivers_map_x_size (Map X size) int 15000 500 66000
# Z size of the grid being generated # Z size of the map being generated
# Actual size of the map is grid_z_size * blocksize #
mapgen_rivers_grid_z_size (Grid Z size) int 1000 50 5000 # Z size of the river grid will be this/blocksize
# When increasing, it is recommended to increase blocksize too
mapgen_rivers_map_z_size (Map Z size) int 15000 500 66000
# Minimal catchment area for a river to be drawn, in square nodes # Minimal catchment area for a river to be drawn, in square nodes
# Lower value means bigger river density # Lower value means bigger river density
@ -23,7 +29,7 @@ mapgen_rivers_min_catchment (Minimal catchment area) float 3600.0 100.0 1000000.
# Coefficient describing how rivers widen when merging. # Coefficient describing how rivers widen when merging.
# Riwer width is a power law W = a*D^p. D is river flow and p is this parameter. # Riwer width is a power law W = a*D^p. D is river flow and p is this parameter.
# Higher value means a river needs to receive more tributaries to grow in width. # Higher value means that a river will grow more when receiving a tributary.
# Note that a river can never exceed 2*blocksize. # Note that a river can never exceed 2*blocksize.
mapgen_rivers_river_widening_power (River widening power) float 0.5 0.0 1.0 mapgen_rivers_river_widening_power (River widening power) float 0.5 0.0 1.0

View File

@ -1,7 +1,13 @@
-- erosion.lua -- erosion.lua
-- This is the main file of terrainlib_lua. It registers the EvolutionModel object and some of the
local function erode(model, time) local function erode(model, time)
--local tinsert = table.insert -- Apply river erosion on the model
-- Erosion model is based on the simplified version of the stream-power law Ey = K×A^m×S
-- where Ey is the vertical erosion speed, A catchment area of the river, S slope along the river, m and K local constants.
-- It is equivalent to considering a horizontal erosion wave travelling at Ex = K×A^m, and this latter approach allows much greather time steps so it is used here.
-- For each point, instead of moving upstream and see what point the erosion wave would reach, we move downstream and see from which point the erosion wave would reach the given point, then we can set the elevation.
local mmin, mmax = math.min, math.max local mmin, mmax = math.min, math.max
local dem = model.dem local dem = model.dem
local dirs = model.dirs local dirs = model.dirs
@ -22,9 +28,9 @@ local function erode(model, time)
if scalars then if scalars then
for i=1, X*Y do for i=1, X*Y do
local etime = 1 / (K*rivers[i]^m) local etime = 1 / (K*rivers[i]^m) -- Inverse of erosion speed (Ex); time needed for the erosion wave to move through the river section.
erosion_time[i] = etime erosion_time[i] = etime
lakes[i] = mmax(lakes[i], dem[i], sea_level) lakes[i] = mmax(lakes[i], dem[i], sea_level) -- Use lake/sea surface if higher than ground level, because rivers can not erode below.
end end
else else
for i=1, X*Y do for i=1, X*Y do
@ -39,10 +45,12 @@ local function erode(model, time)
local remaining = time local remaining = time
local new_elev local new_elev
while true do while true do
-- Explore downstream until we find the point 'iw' from which the erosion wave will reach 'i'
local inext = iw local inext = iw
local d = dirs[iw] local d = dirs[iw]
if d == 0 then -- Follow the river downstream (move 'iw')
if d == 0 then -- If no flow direction, we reach the border of the map: set elevation to the latest node's elev and abort.
new_elev = lakes[iw] new_elev = lakes[iw]
break break
elseif d == 1 then elseif d == 1 then
@ -56,13 +64,13 @@ local function erode(model, time)
end end
local etime = erosion_time[iw] local etime = erosion_time[iw]
if remaining <= etime then if remaining <= etime then -- We have found the node from which the erosion wave will take 'time' to arrive to 'i'.
local c = remaining / etime local c = remaining / etime
new_elev = (1-c) * lakes[iw] + c * lakes[inext] new_elev = (1-c) * lakes[iw] + c * lakes[inext] -- Interpolate linearly between the two nodes
break break
end end
remaining = remaining - etime remaining = remaining - etime -- If we still don't reach the target time, decrement time and move to next point.
iw = inext iw = inext
end end
@ -71,50 +79,55 @@ local function erode(model, time)
end end
local function diffuse(model, time) local function diffuse(model, time)
local mmax = math.max -- Apply diffusion using finite differences methods
local dem = model.dem -- Adapted for small radiuses
local X, Y = dem.X, dem.Y local mmax = math.max
local d = model.params.d local dem = model.dem
local dmax = d local X, Y = dem.X, dem.Y
if type(d) == "table" then local d = model.params.d
dmax = -math.huge -- 'd' is equal to 4 times the diffusion coefficient
for i=1, X*Y do local dmax = d
dmax = mmax(dmax, d[i]) if type(d) == "table" then
end dmax = -math.huge
end for i=1, X*Y do
dmax = mmax(dmax, d[i])
end
end
local diff = dmax * time local diff = dmax * time
local niter = math.floor(diff) + 1 -- diff should never exceed 1 per iteration.
local ddiff = diff / niter -- If needed, we will divide the process in enough iterations so that 'ddiff' is below 1.
local niter = math.floor(diff) + 1
local ddiff = diff / niter
local temp = {} local temp = {}
for n=1, niter do for n=1, niter do
local i = 1 local i = 1
for y=1, Y do for y=1, Y do
local iN = (y==1) and 0 or -X local iN = (y==1) and 0 or -X
local iS = (y==Y) and 0 or X local iS = (y==Y) and 0 or X
for x=1, X do for x=1, X do
local iW = (x==1) and 0 or -1 local iW = (x==1) and 0 or -1
local iE = (x==X) and 0 or 1 local iE = (x==X) and 0 or 1
temp[i] = (dem[i+iN]+dem[i+iE]+dem[i+iS]+dem[i+iW])*0.25 - dem[i] -- Laplacian Δdem × 1/4
i = i + 1 temp[i] = (dem[i+iN]+dem[i+iE]+dem[i+iS]+dem[i+iW])*0.25 - dem[i]
end i = i + 1
end end
end
for i=1, X*Y do for i=1, X*Y do
dem[i] = dem[i] + temp[i]*ddiff dem[i] = dem[i] + temp[i]*ddiff
end end
end end
-- TODO Test this
end end
local modpath = "" local modpath = ""
if minetest then if minetest then
if minetest.global_exists('mapgen_rivers') then if minetest.global_exists('mapgen_rivers') then
modpath = mapgen_rivers.modpath .. "terrainlib_lua/" modpath = mapgen_rivers.modpath .. "terrainlib_lua/"
else else
modpath = minetest.get_modpath(minetest.get_current_modname()) .. "terrainlib_lua/" modpath = minetest.get_modpath(minetest.get_current_modname()) .. "terrainlib_lua/"
end end
end end
local rivermapper = dofile(modpath .. "rivermapper.lua") local rivermapper = dofile(modpath .. "rivermapper.lua")
@ -126,6 +139,7 @@ local function flow(model)
end end
local function uplift(model, time) local function uplift(model, time)
-- Raises the terrain according to uplift rate (model.params.uplift)
local dem = model.dem local dem = model.dem
local X, Y = dem.X, dem.Y local X, Y = dem.X, dem.Y
local uplift_rate = model.params.uplift local uplift_rate = model.params.uplift
@ -142,6 +156,7 @@ local function uplift(model, time)
end end
local function noise(model, time) local function noise(model, time)
-- Adds noise to the terrain according to noise depth (model.params.noise)
local random = math.random local random = math.random
local dem = model.dem local dem = model.dem
local noise_depth = model.params.noise * 2 * time local noise_depth = model.params.noise * 2 * time
@ -151,35 +166,43 @@ local function noise(model, time)
end end
end end
-- Isostasy
-- This is the geological phenomenon that makes the lithosphere "float" over the underlying layers.
-- One of the key implications is that when a very large mass is removed from the ground, the lithosphere reacts by moving upward. This compensation only occurs at large scale (as the lithosphere is not flexible enough for small scale adjustments) so the implementation is using a very large-window Gaussian blur of the elevation array.
-- This implementation is quite simplistic, it does not do a mass balance of the lithosphere as this would introduce too many parameters. Instead, it defines a reference equilibrium elevation, and the ground will react toward this elevation (at the scale of the gaussian window).
-- A change in reference isostasy during the run can also be used to simulate tectonic forcing, like making a new mountain range appear.
local function define_isostasy(model, ref, link) local function define_isostasy(model, ref, link)
ref = ref or model.dem ref = ref or model.dem
if link then if link then
model.isostasy_ref = ref model.isostasy_ref = ref
return return
end end
local X, Y = ref.X, ref.Y local X, Y = ref.X, ref.Y
local ref2 = model.isostasy_ref or {X=X, Y=Y} local ref2 = model.isostasy_ref or {X=X, Y=Y}
model.isostasy_ref = ref2 model.isostasy_ref = ref2
for i=1, X*Y do for i=1, X*Y do
ref2[i] = ref[i] ref2[i] = ref[i]
end end
return ref2 return ref2
end end
-- Apply isostasy
local function isostasy(model) local function isostasy(model)
local dem = model.dem local dem = model.dem
local X, Y = dem.X, dem.Y local X, Y = dem.X, dem.Y
local temp = {X=X, Y=Y} local temp = {X=X, Y=Y}
local ref = model.isostasy_ref local ref = model.isostasy_ref
for i=1, X*Y do for i=1, X*Y do
temp[i] = ref[i] - dem[i] temp[i] = ref[i] - dem[i] -- Compute the difference between the ground level and the target level
end end
-- Blur the difference map using Gaussian blur
gaussian.gaussian_blur_approx(temp, model.params.compensation_radius, 4) gaussian.gaussian_blur_approx(temp, model.params.compensation_radius, 4)
for i=1, X*Y do for i=1, X*Y do
dem[i] = dem[i] + temp[i] dem[i] = dem[i] + temp[i] -- Apply the difference
end end
end end

View File

@ -71,20 +71,6 @@ local function box_blur_2d(map1, size, map2)
return map1 return map1
end end
--[[local function gaussian_blur(map, std, tail)
local exp = math.exp
local kernel_mid = math.ceil(std*tail) + 1
local kernel_size = kernel_mid * 2 - 1
local kernel = {}
local cst1 = 1/(std*(2*math.pi)^0.5)
local cst2 = -1/(2*std^2)
for i=1, kernel_size do
kernel[i] = cst1 * exp((i-kernel_mid)^2 * cst2)
end
]]
local function gaussian_blur_approx(map, sigma, n, map2) local function gaussian_blur_approx(map, sigma, n, map2)
map2 = map2 or {} map2 = map2 or {}
local sizes = get_box_size(sigma, n) local sizes = get_box_size(sigma, n)

View File

@ -9,24 +9,26 @@
-- --
-- Big thanks to them for releasing this paper under a free license ! :) -- Big thanks to them for releasing this paper under a free license ! :)
-- The algorithm here makes use of most of the paper's concepts, including the Planar Boruvka algorithm. -- The algorithm here makes use of most of the paper's concepts, including the Planar Borůvka algorithm.
-- Only flow_local and accumulate_flow are custom algorithms. -- Only flow_local and accumulate_flow are custom algorithms.
local function flow_local_semirandom(plist) local function flow_local_semirandom(plist)
-- Determines how water should flow at 1 node scale.
-- The straightforward approach would be "Water will flow to the lowest of the 4 neighbours", but here water flows to one of the lower neighbours, chosen randomly, but probability depends on height difference.
-- This makes rivers better follow the curvature of the topography at large scale, and be less biased by pure N/E/S/W directions.
-- 'plist': array of downward height differences (0 if upward)
local sum = 0 local sum = 0
for i=1, #plist do for i=1, #plist do
sum = sum + plist[i] sum = sum + plist[i] -- Sum of probabilities
end end
--for _, p in ipairs(plist) do
--sum = sum + p
--end
if sum == 0 then if sum == 0 then
return 0 return 0
end end
local r = math.random() * sum local r = math.random() * sum
for i=1, #plist do for i=1, #plist do
local p = plist[i] local p = plist[i]
--for i, p in ipairs(plist) do
if r < p then if r < p then
return i return i
end end
@ -35,11 +37,14 @@ local function flow_local_semirandom(plist)
return 0 return 0
end end
-- Maybe implement more flow methods in the future?
local flow_methods = { local flow_methods = {
semirandom = flow_local_semirandom, semirandom = flow_local_semirandom,
} }
local function flow_routing(dem, dirs, lakes, method) -- Applies all steps of the flow routing, to calculate flow direction for every node, and lake surface elevation.
-- It's quite a hard piece of code, but we will go step by step and explain what's going on, so stay with me and... let's goooooooo!
local function flow_routing(dem, dirs, lakes, method) -- 'dirs' and 'lakes' are optional tables to reuse for memory optimization, they may contain any data.
method = method or 'semirandom' method = method or 'semirandom'
local flow_local = flow_methods[method] or flow_local_semirandom local flow_local = flow_methods[method] or flow_local_semirandom
@ -47,7 +52,6 @@ local function flow_routing(dem, dirs, lakes, method)
lakes = lakes or {} lakes = lakes or {}
-- Localize for performance -- Localize for performance
--local tinsert = table.insert
local tremove = table.remove local tremove = table.remove
local mmax = math.max local mmax = math.max
@ -62,11 +66,15 @@ local function flow_routing(dem, dirs, lakes, method)
dirs2[i] = 0 dirs2[i] = 0
end end
----------------------------------------
-- STEP 1: Find local flow directions --
----------------------------------------
-- Use the local flow function and fill the flow direction tables
local singular = {} local singular = {}
for y=1, Y do for y=1, Y do
for x=1, X do for x=1, X do
local zi = dem[i] local zi = dem[i]
local plist = { local plist = { -- Get the height difference of the 4 neighbours (and 0 if uphill)
y<Y and mmax(zi-dem[i+X], 0) or 0, -- Southward y<Y and mmax(zi-dem[i+X], 0) or 0, -- Southward
x<X and mmax(zi-dem[i+1], 0) or 0, -- Eastward x<X and mmax(zi-dem[i+1], 0) or 0, -- Eastward
y>1 and mmax(zi-dem[i-X], 0) or 0, -- Northward y>1 and mmax(zi-dem[i-X], 0) or 0, -- Northward
@ -74,8 +82,10 @@ local function flow_routing(dem, dirs, lakes, method)
} }
local d = flow_local(plist) local d = flow_local(plist)
-- 'dirs': Direction toward which water flow
-- 'dirs2': Directions from which water comes
dirs[i] = d dirs[i] = d
if d == 0 then if d == 0 then -- If water can't flow from this node, add it to the list of singular nodes that will be resolved later
singular[#singular+1] = i singular[#singular+1] = i
elseif d == 1 then elseif d == 1 then
dirs2[i+X] = dirs2[i+X] + 1 dirs2[i+X] = dirs2[i+X] + 1
@ -90,30 +100,39 @@ local function flow_routing(dem, dirs, lakes, method)
end end
end end
-- Compute basins and links --------------------------------------
-- STEP 2: Compute basins and links --
--------------------------------------
-- Now water can flow until it reaches a singular node (which is in most cases the bottom of a depression)
-- We will calculate the drainage basin of every singular node (all the nodes from which the water will flow in this singular node, directly or indirectly), make an adjacency list of basins, and find the lowest pass between each pair of adjacent basins (they are potential lake outlets)
local nbasins = #singular local nbasins = #singular
local basin_id = {} local basin_id = {}
local links = {} local links = {}
local basin_links local basin_links
-- Function to analyse a link between two nodes
local function add_link(i1, i2, b1, isY) local function add_link(i1, i2, b1, isY)
-- i1, i2: coordinates of two nodes
-- b1: basin that contains i1
-- isY: whether the link is in Y direction
local b2 local b2
if i2 == 0 then -- Note that basin number #0 represents the outside of the map; or if the coordinate is inside the map, means that the basin number is uninitialized.
if i2 == 0 then -- If outside the map
b2 = 0 b2 = 0
else else
b2 = basin_id[i2] b2 = basin_id[i2]
if b2 == 0 then if b2 == 0 then -- If basin of i2 is not already computed, skip
return return
end end
end end
if b2 ~= b1 then if b2 ~= b1 then -- If these two nodes don't belong to the same basin, we have found a link between two adjacent basins
local elev = i2 == 0 and dem[i1] or mmax(dem[i1], dem[i2]) local elev = i2 == 0 and dem[i1] or mmax(dem[i1], dem[i2]) -- Elevation of the highest of the two sides of the link (or only i1 if b2 is map outside)
local l2 = basin_links[b2] local l2 = basin_links[b2]
if not l2 then if not l2 then
l2 = {} l2 = {}
basin_links[b2] = l2 basin_links[b2] = l2
end end
if not l2.elev or l2.elev > elev then if not l2.elev or l2.elev > elev then -- If this link is lower than the lowest registered link between these two basins, register it as the new lowest pass
l2.elev = elev l2.elev = elev
l2.i = mmax(i1,i2) l2.i = mmax(i1,i2)
l2.is_y = isY l2.is_y = isY
@ -126,51 +145,48 @@ local function flow_routing(dem, dirs, lakes, method)
for i=1, X*Y do for i=1, X*Y do
basin_id[i] = 0 basin_id[i] = 0
end end
--for ib, s in ipairs(singular) do
for ib=1, nbasins do for ib=1, nbasins do
--local s = singular[ib] -- Here we will recursively search upstream from the singular node to determine its drainage basin
local queue = {singular[ib]} local queue = {singular[ib]} -- Start with the singular node, then this queue will be filled with water donors neighbours
basin_links = {} basin_links = {}
links[#links+1] = basin_links links[#links+1] = basin_links
--tinsert(links, basin_links)
while #queue > 0 do while #queue > 0 do
local i = tremove(queue) local i = tremove(queue)
basin_id[i] = ib basin_id[i] = ib
local d = dirs2[i] local d = dirs2[i] -- Get the directions water is coming from
if d >= 8 then -- River coming from East -- Iterate through the 4 directions
if d >= 8 then -- River coming from the East
d = d - 8 d = d - 8
queue[#queue+1] = i+1 queue[#queue+1] = i+1
--tinsert(queue, i+X) -- If no river is coming from the East, we might be at the limit of two basins, thus we need to test adjacency.
elseif i%X > 0 then elseif i%X > 0 then
add_link(i, i+1, ib, false) add_link(i, i+1, ib, false)
else else -- If the eastern neighbour is outside the map
add_link(i, 0, ib, false) add_link(i, 0, ib, false)
end end
if d >= 4 then -- River coming from South if d >= 4 then -- River coming from the South
d = d - 4 d = d - 4
queue[#queue+1] = i+X queue[#queue+1] = i+X
--tinsert(queue, i+1)
elseif i <= X*(Y-1) then elseif i <= X*(Y-1) then
add_link(i, i+X, ib, true) add_link(i, i+X, ib, true)
else else
add_link(i, 0, ib, true) add_link(i, 0, ib, true)
end end
if d >= 2 then -- River coming from West if d >= 2 then -- River coming from the West
d = d - 2 d = d - 2
queue[#queue+1] = i-1 queue[#queue+1] = i-1
--tinsert(queue, i-X)
elseif i%X ~= 1 then elseif i%X ~= 1 then
add_link(i, i-1, ib, false) add_link(i, i-1, ib, false)
else else
add_link(i, 0, ib, false) add_link(i, 0, ib, false)
end end
if d >= 1 then -- River coming from North if d >= 1 then -- River coming from the North
queue[#queue+1] = i-X queue[#queue+1] = i-X
--tinsert(queue, i-1)
elseif i > X then elseif i > X then
add_link(i, i-X, ib, true) add_link(i, i-X, ib, true)
else else
@ -186,7 +202,7 @@ local function flow_routing(dem, dirs, lakes, method)
nlinks[i] = 0 nlinks[i] = 0
end end
--for ib1, blinks in ipairs(links) do -- Iterate through pairs of adjacent basins, and make the links reciprocal
for ib1=1, #links do for ib1=1, #links do
for ib2, link in pairs(links[ib1]) do for ib2, link in pairs(links[ib1]) do
if ib2 < ib1 then if ib2 < ib1 then
@ -197,6 +213,15 @@ local function flow_routing(dem, dirs, lakes, method)
end end
end end
-----------------------------------------------------
-- STEP 3: Compute minimal spanning tree of basins --
-----------------------------------------------------
-- We've got an adjacency list of basins with the elevation of their links.
-- We will build a minimal spanning tree of the basins (where costs are the elevation of the links). As demonstrated by Cordonnier et al., this finds the outlets of the basins, where water would naturally flow. This does not tell in which direction water is flowing, however.
-- We will use a version of Borůvka's algorithm, with Mareš' optimizations to approach linear complexity (see paper).
-- The concept of Borůvka's algorithm is to take elements and merge them with their lowest neighbour, until all elements are merged.
-- Mareš' optimizations mainly consist in skipping elements that have over 8 links, until extra links are removed when other elements are merged.
-- Note that for this step we are only working on basins, not grid nodes.
local lowlevel = {} local lowlevel = {}
for i, n in pairs(nlinks) do for i, n in pairs(nlinks) do
if n <= 8 then if n <= 8 then
@ -206,6 +231,8 @@ local function flow_routing(dem, dirs, lakes, method)
local basin_graph = {} local basin_graph = {}
for n=1, nbasins do for n=1, nbasins do
-- Iterate in lowlevel but its contents may change during the loop
-- 'next' called with only one argument always returns an element if table is not empty
local b1, lnk1 = next(lowlevel) local b1, lnk1 = next(lowlevel)
lowlevel[b1] = nil lowlevel[b1] = nil
@ -213,6 +240,7 @@ local function flow_routing(dem, dirs, lakes, method)
local lowest = math.huge local lowest = math.huge
local lnk1 = links[b1] local lnk1 = links[b1]
local i = 0 local i = 0
-- Look for lowest link
for bn, bdata in pairs(lnk1) do for bn, bdata in pairs(lnk1) do
i = i + 1 i = i + 1
if bdata.elev < lowest then if bdata.elev < lowest then
@ -221,7 +249,7 @@ local function flow_routing(dem, dirs, lakes, method)
end end
end end
-- Add link to the graph -- Add link to the graph, in both directions
local bound = lnk1[b2] local bound = lnk1[b2]
local bb1, bb2 = bound[1], bound[2] local bb1, bb2 = bound[1], bound[2]
if not basin_graph[bb1] then if not basin_graph[bb1] then
@ -239,6 +267,7 @@ local function flow_routing(dem, dirs, lakes, method)
lnk1[b2] = nil lnk1[b2] = nil
lnk2[b1] = nil lnk2[b1] = nil
nlinks[b2] = nlinks[b2] - 1 nlinks[b2] = nlinks[b2] - 1
-- When the number of links is changing, we need to check whether the basin can be added to / removed from 'lowlevel'
if nlinks[b2] == 8 then if nlinks[b2] == 8 then
lowlevel[b2] = lnk2 lowlevel[b2] = lnk2
end end
@ -247,25 +276,32 @@ local function flow_routing(dem, dirs, lakes, method)
local lnkn = links[bn] local lnkn = links[bn]
lnkn[b1] = nil lnkn[b1] = nil
if lnkn[b2] then if lnkn[b2] then -- If bassin bn is also linked to b2
nlinks[bn] = nlinks[bn] - 1 nlinks[bn] = nlinks[bn] - 1 -- Then bassin bn is losing a link because it keeps only one link toward b1/b2 after the merge
if nlinks[bn] == 8 then if nlinks[bn] == 8 then
lowlevel[bn] = lnkn lowlevel[bn] = lnkn
end end
else else -- If bn was linked to b1 but not to b2
nlinks[b2] = nlinks[b2] + 1 nlinks[b2] = nlinks[b2] + 1 -- Then b2 is gaining a link to bn because of the merge
if nlinks[b2] == 9 then if nlinks[b2] == 9 then
lowlevel[b2] = nil lowlevel[b2] = nil
end end
end end
if not lnkn[b2] or lnkn[b2].elev > bdata.elev then if not lnkn[b2] or lnkn[b2].elev > bdata.elev then -- If the link b1-bn will become the new lowest link between b2 and bn, redirect the link to b2
lnkn[b2] = bdata lnkn[b2] = bdata
lnk2[bn] = bdata lnk2[bn] = bdata
end end
end end
end end
--------------------------------------------------------------
-- STEP 4: Orient basin graph, and grid nodes inside basins --
--------------------------------------------------------------
-- We will finally solve those freaking singular nodes.
-- To orient the basin graph, we will consider that the ultimate basin water should flow into is the map outside (basin #0). We will start from it and recursively walk upstream to the neighbouring basins, using only links that are in the minimal spanning tree. This gives the flow direction of the links, and thus, the outlet of every basin.
-- This will also give lake elevation, which is the highest link encountered between map outside and the given basin on the spanning tree.
-- And within each basin, we need to modify flow directions to connect the singular node to the outlet.
local queue = {[0] = -math.huge} local queue = {[0] = -math.huge}
local basin_lake = {} local basin_lake = {}
for n=1, nbasins do for n=1, nbasins do
@ -273,15 +309,17 @@ local function flow_routing(dem, dirs, lakes, method)
end end
local reverse = {3, 4, 1, 2, [0]=0} local reverse = {3, 4, 1, 2, [0]=0}
for n=1, nbasins do for n=1, nbasins do
local b1, elev1 = next(queue) local b1, elev1 = next(queue) -- Pop from queue
queue[b1] = nil queue[b1] = nil
basin_lake[b1] = elev1 basin_lake[b1] = elev1
-- Iterate through b1's neighbours (according to the spanning tree)
for b2, bound in pairs(basin_graph[b1]) do for b2, bound in pairs(basin_graph[b1]) do
-- Make b2 flow into b1 -- Make b2 flow into b1
local i = bound.i local i = bound.i -- Get the coordinate of the link (which is the basin's outlet)
local dir = bound.is_y and 3 or 4 local dir = bound.is_y and 3 or 4 -- And get the direction (S/E/N/W)
if basin_id[i] ~= b2 then if basin_id[i] ~= b2 then
dir = dir - 2 dir = dir - 2
-- Coordinate 'i' refers to the side of the link with the highest X/Y position. In case it is in the wrong basin, take the other side by decrementing by one row/column.
if bound.is_y then if bound.is_y then
i = i - X i = i - X
else else
@ -291,8 +329,12 @@ local function flow_routing(dem, dirs, lakes, method)
dir = 0 dir = 0
end end
-- Use the flow directions computed in STEP 2 to find the route from the outlet position to the singular node, and reverse this route to make the singular node flow into the outlet
-- This can make the river flow uphill, which may seem unnatural, but it can only happen below a lake (because outlet elevation defines lake surface elevation)
repeat repeat
-- Assign i's direction to 'dir', and get i's former direction
dir, dirs[i] = dirs[i], dir dir, dirs[i] = dirs[i], dir
-- Move i by following its former flow direction (downstream)
if dir == 1 then if dir == 1 then
i = i + X i = i + X
elseif dir == 2 then elseif dir == 2 then
@ -302,26 +344,36 @@ local function flow_routing(dem, dirs, lakes, method)
elseif dir == 4 then elseif dir == 4 then
i = i - 1 i = i - 1
end end
-- Reverse the flow direction for the next node, which will flow into i
dir = reverse[dir] dir = reverse[dir]
until dir == 0 until dir == 0 -- Stop when reaching the singular node
-- Add b2 into the queue
-- Add basin b2 into the queue, and keep the highest link elevation, that will define the elevation of the lake in b2
queue[b2] = mmax(elev1, bound.elev) queue[b2] = mmax(elev1, bound.elev)
-- Remove b1 from b2's neighbours to avoid coming back to b1
basin_graph[b2][b1] = nil basin_graph[b2][b1] = nil
end end
basin_graph[b1] = nil basin_graph[b1] = nil
end end
-- Every node will be assigned the lake elevation of the basin it belongs to.
-- If lake elevation is lower than ground elevation, it simply means that there is no lake here.
for i=1, X*Y do for i=1, X*Y do
lakes[i] = basin_lake[basin_id[i]] lakes[i] = basin_lake[basin_id[i]]
end end
-- That's it!
return dirs, lakes return dirs, lakes
end end
local function accumulate(dirs, waterq) local function accumulate(dirs, waterq)
-- Calculates the river flow by determining the surface of the catchment area for every node
-- This means: how many nodes will give their water to that given node, directly or indirectly?
-- This is obtained by following rivers downstream and summing up the flow of every tributary, starting with a value of 1 at the sources.
-- This will give non-zero values for every node but only large values will be considered to be rivers.
waterq = waterq or {} waterq = waterq or {}
local X, Y = dirs.X, dirs.Y local X, Y = dirs.X, dirs.Y
--local tinsert = table.insert
local ndonors = {} local ndonors = {}
local waterq = {X=X, Y=Y} local waterq = {X=X, Y=Y}
@ -330,7 +382,7 @@ local function accumulate(dirs, waterq)
waterq[i] = 1 waterq[i] = 1
end end
--for i1, dir in ipairs(dirs) do -- Calculate the number of direct donors
for i1=1, X*Y do for i1=1, X*Y do
local i2 local i2
local dir = dirs[i1] local dir = dirs[i1]
@ -349,10 +401,12 @@ local function accumulate(dirs, waterq)
end end
for i1=1, X*Y do for i1=1, X*Y do
-- Find sources (nodes that have no donor)
if ndonors[i1] == 0 then if ndonors[i1] == 0 then
local i2 = i1 local i2 = i1
local dir = dirs[i2] local dir = dirs[i2]
local w = waterq[i2] local w = waterq[i2]
-- Follow the water flow downstream: move 'i2' to the next node according to its flow direction
while dir > 0 do while dir > 0 do
if dir == 1 then if dir == 1 then
i2 = i2 + X i2 = i2 + X
@ -363,9 +417,12 @@ local function accumulate(dirs, waterq)
elseif dir == 4 then elseif dir == 4 then
i2 = i2 - 1 i2 = i2 - 1
end end
-- Increment the water quantity of i2
w = w + waterq[i2] w = w + waterq[i2]
waterq[i2] = w waterq[i2] = w
-- Stop on an unresolved confluence (node with >1 donors) and decrease the number of remaining donors
-- When the ndonors of a confluence has decreased to 1, it means that its water quantity has already been incremented by its tributaries, so it can be resolved like a standard river section. However, do not decrease ndonors to zero to avoid considering it as a source.
if ndonors[i2] > 1 then if ndonors[i2] > 1 then
ndonors[i2] = ndonors[i2] - 1 ndonors[i2] = ndonors[i2] - 1
break break

View File

@ -1,4 +1,4 @@
-- bounds.lua -- twist.lua
local function get_bounds(dirs, rivers) local function get_bounds(dirs, rivers)
local X, Y = dirs.X, dirs.Y local X, Y = dirs.X, dirs.Y