mirror of
https://github.com/Azgaar/Fantasy-Map-Generator.git
synced 2025-12-17 17:51:24 +01:00
84 lines
2.8 KiB
TypeScript
84 lines
2.8 KiB
TypeScript
import * as d3 from "d3";
|
|
|
|
import {TIME, WARN} from "config/logging";
|
|
import {getInputNumber} from "utils/nodeUtils";
|
|
import {rn} from "utils/numberUtils";
|
|
import {gauss} from "utils/probabilityUtils";
|
|
|
|
const {Names} = window;
|
|
|
|
export function createTowns(
|
|
burgIds: Uint16Array,
|
|
cultures: TCultures,
|
|
cells: Pick<IPack["cells"], "p" | "i" | "f" | "s" | "culture">
|
|
) {
|
|
TIME && console.time("createTowns");
|
|
|
|
// randomize cells score a bit for more natural towns placement
|
|
const randomizeScore = (suitability: number) => suitability * gauss(1, 3, 0, 20, 3);
|
|
const scores = new Int16Array(cells.s.map(randomizeScore));
|
|
|
|
// take populated cells without capitals
|
|
const scoredCellIds = cells.i.filter(i => scores[i] > 0 && cells.culture[i] && !burgIds[i]);
|
|
scoredCellIds.sort((a, b) => scores[b] - scores[a]); // sort by randomized suitability score
|
|
|
|
const townsNumber = getTownsNumber();
|
|
if (townsNumber === 0) return [];
|
|
|
|
const townCells = placeTowns(townsNumber, scoredCellIds, cells.p);
|
|
|
|
const towns = townCells.map((cellId, index) => {
|
|
const id = index + 1;
|
|
const cultureId = cells.culture[cellId];
|
|
const namesbase = cultures[cultureId].base;
|
|
const name: string = Names.getBase(namesbase);
|
|
const featureId = cells.f[cellId];
|
|
|
|
return {i: id, cell: cellId, culture: cultureId, name, feature: featureId, capital: 0 as Logical};
|
|
});
|
|
|
|
for (const {cell, i} of towns) {
|
|
burgIds[cell] = i;
|
|
}
|
|
|
|
TIME && console.timeEnd("createTowns");
|
|
return towns;
|
|
|
|
function getTownsNumber() {
|
|
const inputTownsNumber = getInputNumber("manorsInput");
|
|
const shouldAutoDefine = inputTownsNumber === 1000;
|
|
const desiredTownsNumber = shouldAutoDefine ? rn(scoredCellIds.length / 5 ** 0.8) : inputTownsNumber;
|
|
|
|
return Math.min(desiredTownsNumber, scoredCellIds.length);
|
|
}
|
|
}
|
|
|
|
function placeTowns(townsNumber: number, scoredCellIds: UintArray, points: TPoints) {
|
|
function attemptToPlaceTowns(spacing: number): number[] {
|
|
const townCells: number[] = [];
|
|
const townsQuadtree = d3.quadtree();
|
|
|
|
const randomizeScaping = (spacing: number) => spacing * gauss(1, 0.3, 0.2, 2, 2);
|
|
|
|
for (const cellId of scoredCellIds) {
|
|
const [x, y] = points[cellId];
|
|
|
|
// randomize min spacing a bit to make placement not that uniform
|
|
const currentSpacing = randomizeScaping(spacing);
|
|
|
|
if (townsQuadtree.find(x, y, currentSpacing) === undefined) {
|
|
townCells.push(cellId);
|
|
townsQuadtree.add([x, y]);
|
|
|
|
if (townCells.length === townsNumber) return townCells;
|
|
}
|
|
}
|
|
|
|
WARN && console.warn("Cannot place towns, trying again with reduced spacing");
|
|
return attemptToPlaceTowns(spacing / 2);
|
|
}
|
|
|
|
// initial min distance between towns, reduced by 2 each iteration if not enough space
|
|
const initialSpacing = (graphWidth + graphHeight) / 150 / (townsNumber ** 0.7 / 66);
|
|
return attemptToPlaceTowns(initialSpacing);
|
|
}
|