mirror of
https://github.com/Azgaar/Fantasy-Map-Generator.git
synced 2025-12-16 17:31:24 +01:00
543 lines
15 KiB
JavaScript
543 lines
15 KiB
JavaScript
"use strict";
|
|
|
|
window.HeightmapGenerator = (function () {
|
|
let grid = null;
|
|
let heights = null;
|
|
let blobPower;
|
|
let linePower;
|
|
|
|
const setGraph = graph => {
|
|
const {cellsDesired, cells, points} = graph;
|
|
heights = cells.h ? Uint8Array.from(cells.h) : createTypedArray({maxValue: 100, length: points.length});
|
|
blobPower = getBlobPower(cellsDesired);
|
|
linePower = getLinePower(cellsDesired);
|
|
grid = graph;
|
|
};
|
|
|
|
const getHeights = () => heights;
|
|
|
|
const clearData = () => {
|
|
heights = null;
|
|
grid = null;
|
|
};
|
|
|
|
const fromTemplate = (graph, id) => {
|
|
const templateString = heightmapTemplates[id]?.template || "";
|
|
const steps = templateString.split("\n");
|
|
|
|
if (!steps.length) throw new Error(`Heightmap template: no steps. Template: ${id}. Steps: ${steps}`);
|
|
setGraph(graph);
|
|
|
|
for (const step of steps) {
|
|
const elements = step.trim().split(" ");
|
|
if (elements.length < 2) throw new Error(`Heightmap template: steps < 2. Template: ${id}. Step: ${elements}`);
|
|
addStep(...elements);
|
|
}
|
|
|
|
return heights;
|
|
};
|
|
|
|
const fromPrecreated = (graph, id) => {
|
|
return new Promise(resolve => {
|
|
// create canvas where 1px corresponts to a cell
|
|
const canvas = document.createElement("canvas");
|
|
const ctx = canvas.getContext("2d");
|
|
const {cellsX, cellsY} = graph;
|
|
canvas.width = cellsX;
|
|
canvas.height = cellsY;
|
|
|
|
// load heightmap into image and render to canvas
|
|
const img = new Image();
|
|
img.src = `./heightmaps/${id}.png`;
|
|
img.onload = () => {
|
|
ctx.drawImage(img, 0, 0, cellsX, cellsY);
|
|
const imageData = ctx.getImageData(0, 0, cellsX, cellsY);
|
|
setGraph(graph);
|
|
getHeightsFromImageData(imageData.data);
|
|
canvas.remove();
|
|
img.remove();
|
|
resolve(heights);
|
|
};
|
|
});
|
|
};
|
|
|
|
const generate = async function (graph) {
|
|
TIME && console.time("defineHeightmap");
|
|
const id = byId("templateInput").value;
|
|
|
|
Math.random = aleaPRNG(seed);
|
|
const isTemplate = id in heightmapTemplates;
|
|
const heights = isTemplate ? fromTemplate(graph, id) : await fromPrecreated(graph, id);
|
|
TIME && console.timeEnd("defineHeightmap");
|
|
|
|
clearData();
|
|
return heights;
|
|
};
|
|
|
|
function addStep(tool, a2, a3, a4, a5) {
|
|
if (tool === "Hill") return addHill(a2, a3, a4, a5);
|
|
if (tool === "Pit") return addPit(a2, a3, a4, a5);
|
|
if (tool === "Range") return addRange(a2, a3, a4, a5);
|
|
if (tool === "Trough") return addTrough(a2, a3, a4, a5);
|
|
if (tool === "Strait") return addStrait(a2, a3);
|
|
if (tool === "Mask") return mask(a2);
|
|
if (tool === "Invert") return invert(a2, a3);
|
|
if (tool === "Add") return modify(a3, +a2, 1);
|
|
if (tool === "Multiply") return modify(a3, 0, +a2);
|
|
if (tool === "Smooth") return smooth(a2);
|
|
}
|
|
|
|
function getBlobPower(cells) {
|
|
const blobPowerMap = {
|
|
1000: 0.93,
|
|
2000: 0.95,
|
|
5000: 0.97,
|
|
10000: 0.98,
|
|
20000: 0.99,
|
|
30000: 0.991,
|
|
40000: 0.993,
|
|
50000: 0.994,
|
|
60000: 0.995,
|
|
70000: 0.9955,
|
|
80000: 0.996,
|
|
90000: 0.9964,
|
|
100000: 0.9973
|
|
};
|
|
return blobPowerMap[cells] || 0.98;
|
|
}
|
|
|
|
function getLinePower() {
|
|
const linePowerMap = {
|
|
1000: 0.75,
|
|
2000: 0.77,
|
|
5000: 0.79,
|
|
10000: 0.81,
|
|
20000: 0.82,
|
|
30000: 0.83,
|
|
40000: 0.84,
|
|
50000: 0.86,
|
|
60000: 0.87,
|
|
70000: 0.88,
|
|
80000: 0.91,
|
|
90000: 0.92,
|
|
100000: 0.93
|
|
};
|
|
|
|
return linePowerMap[cells] || 0.81;
|
|
}
|
|
|
|
const addHill = (count, height, rangeX, rangeY) => {
|
|
count = getNumberInRange(count);
|
|
while (count > 0) {
|
|
addOneHill();
|
|
count--;
|
|
}
|
|
|
|
function addOneHill() {
|
|
const change = new Uint8Array(heights.length);
|
|
let limit = 0;
|
|
let start;
|
|
let h = lim(getNumberInRange(height));
|
|
|
|
do {
|
|
const x = getPointInRange(rangeX, graphWidth);
|
|
const y = getPointInRange(rangeY, graphHeight);
|
|
start = findGridCell(x, y, grid);
|
|
limit++;
|
|
} while (heights[start] + h > 90 && limit < 50);
|
|
|
|
change[start] = h;
|
|
const queue = [start];
|
|
while (queue.length) {
|
|
const q = queue.shift();
|
|
|
|
for (const c of grid.cells.c[q]) {
|
|
if (change[c]) continue;
|
|
change[c] = change[q] ** blobPower * (Math.random() * 0.2 + 0.9);
|
|
if (change[c] > 1) queue.push(c);
|
|
}
|
|
}
|
|
|
|
heights = heights.map((h, i) => lim(h + change[i]));
|
|
}
|
|
};
|
|
|
|
const addPit = (count, height, rangeX, rangeY) => {
|
|
count = getNumberInRange(count);
|
|
while (count > 0) {
|
|
addOnePit();
|
|
count--;
|
|
}
|
|
|
|
function addOnePit() {
|
|
const used = new Uint8Array(heights.length);
|
|
let limit = 0,
|
|
start;
|
|
let h = lim(getNumberInRange(height));
|
|
|
|
do {
|
|
const x = getPointInRange(rangeX, graphWidth);
|
|
const y = getPointInRange(rangeY, graphHeight);
|
|
start = findGridCell(x, y, grid);
|
|
limit++;
|
|
} while (heights[start] < 20 && limit < 50);
|
|
|
|
const queue = [start];
|
|
while (queue.length) {
|
|
const q = queue.shift();
|
|
h = h ** blobPower * (Math.random() * 0.2 + 0.9);
|
|
if (h < 1) return;
|
|
|
|
grid.cells.c[q].forEach(function (c, i) {
|
|
if (used[c]) return;
|
|
heights[c] = lim(heights[c] - h * (Math.random() * 0.2 + 0.9));
|
|
used[c] = 1;
|
|
queue.push(c);
|
|
});
|
|
}
|
|
}
|
|
};
|
|
|
|
// fromCell, toCell are options cell ids
|
|
const addRange = (count, height, rangeX, rangeY, startCell, endCell) => {
|
|
count = getNumberInRange(count);
|
|
while (count > 0) {
|
|
addOneRange();
|
|
count--;
|
|
}
|
|
|
|
function addOneRange() {
|
|
const used = new Uint8Array(heights.length);
|
|
let h = lim(getNumberInRange(height));
|
|
|
|
if (rangeX && rangeY) {
|
|
// find start and end points
|
|
const startX = getPointInRange(rangeX, graphWidth);
|
|
const startY = getPointInRange(rangeY, graphHeight);
|
|
|
|
let dist = 0,
|
|
limit = 0,
|
|
endX,
|
|
endY;
|
|
|
|
do {
|
|
endX = Math.random() * graphWidth * 0.8 + graphWidth * 0.1;
|
|
endY = Math.random() * graphHeight * 0.7 + graphHeight * 0.15;
|
|
dist = Math.abs(endY - startY) + Math.abs(endX - startX);
|
|
limit++;
|
|
} while ((dist < graphWidth / 8 || dist > graphWidth / 3) && limit < 50);
|
|
|
|
startCell = findGridCell(startX, startY, grid);
|
|
endCell = findGridCell(endX, endY, grid);
|
|
}
|
|
|
|
let range = getRange(startCell, endCell);
|
|
|
|
// get main ridge
|
|
function getRange(cur, end) {
|
|
const range = [cur];
|
|
const p = grid.points;
|
|
used[cur] = 1;
|
|
|
|
while (cur !== end) {
|
|
let min = Infinity;
|
|
grid.cells.c[cur].forEach(function (e) {
|
|
if (used[e]) return;
|
|
let diff = (p[end][0] - p[e][0]) ** 2 + (p[end][1] - p[e][1]) ** 2;
|
|
if (Math.random() > 0.85) diff = diff / 2;
|
|
if (diff < min) {
|
|
min = diff;
|
|
cur = e;
|
|
}
|
|
});
|
|
if (min === Infinity) return range;
|
|
range.push(cur);
|
|
used[cur] = 1;
|
|
}
|
|
|
|
return range;
|
|
}
|
|
|
|
// add height to ridge and cells around
|
|
let queue = range.slice(),
|
|
i = 0;
|
|
while (queue.length) {
|
|
const frontier = queue.slice();
|
|
(queue = []), i++;
|
|
frontier.forEach(i => {
|
|
heights[i] = lim(heights[i] + h * (Math.random() * 0.3 + 0.85));
|
|
});
|
|
h = h ** linePower - 1;
|
|
if (h < 2) break;
|
|
frontier.forEach(f => {
|
|
grid.cells.c[f].forEach(i => {
|
|
if (!used[i]) {
|
|
queue.push(i);
|
|
used[i] = 1;
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
// generate prominences
|
|
range.forEach((cur, d) => {
|
|
if (d % 6 !== 0) return;
|
|
for (const l of d3.range(i)) {
|
|
const min = grid.cells.c[cur][d3.scan(grid.cells.c[cur], (a, b) => heights[a] - heights[b])]; // downhill cell
|
|
heights[min] = (heights[cur] * 2 + heights[min]) / 3;
|
|
cur = min;
|
|
}
|
|
});
|
|
}
|
|
};
|
|
|
|
const addTrough = (count, height, rangeX, rangeY, startCell, endCell) => {
|
|
count = getNumberInRange(count);
|
|
while (count > 0) {
|
|
addOneTrough();
|
|
count--;
|
|
}
|
|
|
|
function addOneTrough() {
|
|
const used = new Uint8Array(heights.length);
|
|
let h = lim(getNumberInRange(height));
|
|
|
|
if (rangeX && rangeY) {
|
|
// find start and end points
|
|
let limit = 0,
|
|
startX,
|
|
startY,
|
|
dist = 0,
|
|
endX,
|
|
endY;
|
|
do {
|
|
startX = getPointInRange(rangeX, graphWidth);
|
|
startY = getPointInRange(rangeY, graphHeight);
|
|
startCell = findGridCell(startX, startY, grid);
|
|
limit++;
|
|
} while (heights[startCell] < 20 && limit < 50);
|
|
|
|
limit = 0;
|
|
do {
|
|
endX = Math.random() * graphWidth * 0.8 + graphWidth * 0.1;
|
|
endY = Math.random() * graphHeight * 0.7 + graphHeight * 0.15;
|
|
dist = Math.abs(endY - startY) + Math.abs(endX - startX);
|
|
limit++;
|
|
} while ((dist < graphWidth / 8 || dist > graphWidth / 2) && limit < 50);
|
|
|
|
endCell = findGridCell(endX, endY, grid);
|
|
}
|
|
|
|
let range = getRange(startCell, endCell);
|
|
|
|
// get main ridge
|
|
function getRange(cur, end) {
|
|
const range = [cur];
|
|
const p = grid.points;
|
|
used[cur] = 1;
|
|
|
|
while (cur !== end) {
|
|
let min = Infinity;
|
|
grid.cells.c[cur].forEach(function (e) {
|
|
if (used[e]) return;
|
|
let diff = (p[end][0] - p[e][0]) ** 2 + (p[end][1] - p[e][1]) ** 2;
|
|
if (Math.random() > 0.8) diff = diff / 2;
|
|
if (diff < min) {
|
|
min = diff;
|
|
cur = e;
|
|
}
|
|
});
|
|
if (min === Infinity) return range;
|
|
range.push(cur);
|
|
used[cur] = 1;
|
|
}
|
|
|
|
return range;
|
|
}
|
|
|
|
// add height to ridge and cells around
|
|
let queue = range.slice(),
|
|
i = 0;
|
|
while (queue.length) {
|
|
const frontier = queue.slice();
|
|
(queue = []), i++;
|
|
frontier.forEach(i => {
|
|
heights[i] = lim(heights[i] - h * (Math.random() * 0.3 + 0.85));
|
|
});
|
|
h = h ** linePower - 1;
|
|
if (h < 2) break;
|
|
frontier.forEach(f => {
|
|
grid.cells.c[f].forEach(i => {
|
|
if (!used[i]) {
|
|
queue.push(i);
|
|
used[i] = 1;
|
|
}
|
|
});
|
|
});
|
|
}
|
|
|
|
// generate prominences
|
|
range.forEach((cur, d) => {
|
|
if (d % 6 !== 0) return;
|
|
for (const l of d3.range(i)) {
|
|
const min = grid.cells.c[cur][d3.scan(grid.cells.c[cur], (a, b) => heights[a] - heights[b])]; // downhill cell
|
|
//debug.append("circle").attr("cx", p[min][0]).attr("cy", p[min][1]).attr("r", 1);
|
|
heights[min] = (heights[cur] * 2 + heights[min]) / 3;
|
|
cur = min;
|
|
}
|
|
});
|
|
}
|
|
};
|
|
|
|
const addStrait = (width, direction = "vertical") => {
|
|
width = Math.min(getNumberInRange(width), grid.cellsX / 3);
|
|
if (width < 1 && P(width)) return;
|
|
const used = new Uint8Array(heights.length);
|
|
const vert = direction === "vertical";
|
|
const startX = vert ? Math.floor(Math.random() * graphWidth * 0.4 + graphWidth * 0.3) : 5;
|
|
const startY = vert ? 5 : Math.floor(Math.random() * graphHeight * 0.4 + graphHeight * 0.3);
|
|
const endX = vert
|
|
? Math.floor(graphWidth - startX - graphWidth * 0.1 + Math.random() * graphWidth * 0.2)
|
|
: graphWidth - 5;
|
|
const endY = vert
|
|
? graphHeight - 5
|
|
: Math.floor(graphHeight - startY - graphHeight * 0.1 + Math.random() * graphHeight * 0.2);
|
|
|
|
const start = findGridCell(startX, startY, grid);
|
|
const end = findGridCell(endX, endY, grid);
|
|
let range = getRange(start, end);
|
|
const query = [];
|
|
|
|
function getRange(cur, end) {
|
|
const range = [];
|
|
const p = grid.points;
|
|
|
|
while (cur !== end) {
|
|
let min = Infinity;
|
|
grid.cells.c[cur].forEach(function (e) {
|
|
let diff = (p[end][0] - p[e][0]) ** 2 + (p[end][1] - p[e][1]) ** 2;
|
|
if (Math.random() > 0.8) diff = diff / 2;
|
|
if (diff < min) {
|
|
min = diff;
|
|
cur = e;
|
|
}
|
|
});
|
|
range.push(cur);
|
|
}
|
|
|
|
return range;
|
|
}
|
|
|
|
const step = 0.1 / width;
|
|
|
|
while (width > 0) {
|
|
const exp = 0.9 - step * width;
|
|
range.forEach(function (r) {
|
|
grid.cells.c[r].forEach(function (e) {
|
|
if (used[e]) return;
|
|
used[e] = 1;
|
|
query.push(e);
|
|
heights[e] **= exp;
|
|
if (heights[e] > 100) heights[e] = 5;
|
|
});
|
|
});
|
|
range = query.slice();
|
|
|
|
width--;
|
|
}
|
|
};
|
|
|
|
const modify = (range, add, mult, power) => {
|
|
const min = range === "land" ? 20 : range === "all" ? 0 : +range.split("-")[0];
|
|
const max = range === "land" || range === "all" ? 100 : +range.split("-")[1];
|
|
const isLand = min === 20;
|
|
|
|
heights = heights.map(h => {
|
|
if (h < min || h > max) return h;
|
|
|
|
if (add) h = isLand ? Math.max(h + add, 20) : h + add;
|
|
if (mult !== 1) h = isLand ? (h - 20) * mult + 20 : h * mult;
|
|
if (power) h = isLand ? (h - 20) ** power + 20 : h ** power;
|
|
return lim(h);
|
|
});
|
|
};
|
|
|
|
const smooth = (fr = 2, add = 0) => {
|
|
heights = heights.map((h, i) => {
|
|
const a = [h];
|
|
grid.cells.c[i].forEach(c => a.push(heights[c]));
|
|
if (fr === 1) return d3.mean(a) + add;
|
|
return lim((h * (fr - 1) + d3.mean(a) + add) / fr);
|
|
});
|
|
};
|
|
|
|
const mask = (power = 1) => {
|
|
const fr = power ? Math.abs(power) : 1;
|
|
|
|
heights = heights.map((h, i) => {
|
|
const [x, y] = grid.points[i];
|
|
const nx = (2 * x) / graphWidth - 1; // [-1, 1], 0 is center
|
|
const ny = (2 * y) / graphHeight - 1; // [-1, 1], 0 is center
|
|
let distance = (1 - nx ** 2) * (1 - ny ** 2); // 1 is center, 0 is edge
|
|
if (power < 0) distance = 1 - distance; // inverted, 0 is center, 1 is edge
|
|
const masked = h * distance;
|
|
return lim((h * (fr - 1) + masked) / fr);
|
|
});
|
|
};
|
|
|
|
const invert = (count, axes) => {
|
|
if (!P(count)) return;
|
|
|
|
const invertX = axes !== "y";
|
|
const invertY = axes !== "x";
|
|
const {cellsX, cellsY} = grid;
|
|
|
|
const inverted = heights.map((h, i) => {
|
|
const x = i % cellsX;
|
|
const y = Math.floor(i / cellsX);
|
|
|
|
const nx = invertX ? cellsX - x - 1 : x;
|
|
const ny = invertY ? cellsY - y - 1 : y;
|
|
const invertedI = nx + ny * cellsX;
|
|
return heights[invertedI];
|
|
});
|
|
|
|
heights = inverted;
|
|
};
|
|
|
|
function getPointInRange(range, length) {
|
|
if (typeof range !== "string") {
|
|
ERROR && console.error("Range should be a string");
|
|
return;
|
|
}
|
|
|
|
const min = range.split("-")[0] / 100 || 0;
|
|
const max = range.split("-")[1] / 100 || min;
|
|
return rand(min * length, max * length);
|
|
}
|
|
|
|
function getHeightsFromImageData(imageData) {
|
|
for (let i = 0; i < heights.length; i++) {
|
|
const lightness = imageData[i * 4] / 255;
|
|
const powered = lightness < 0.2 ? lightness : 0.2 + (lightness - 0.2) ** 0.8;
|
|
heights[i] = minmax(Math.floor(powered * 100), 0, 100);
|
|
}
|
|
}
|
|
|
|
return {
|
|
setGraph,
|
|
getHeights,
|
|
generate,
|
|
fromTemplate,
|
|
fromPrecreated,
|
|
addHill,
|
|
addRange,
|
|
addTrough,
|
|
addStrait,
|
|
addPit,
|
|
smooth,
|
|
modify,
|
|
mask,
|
|
invert
|
|
};
|
|
})();
|