backups/Fantasy-Map-Generator
1
0
Fork 0
mirror of https://github.com/Azgaar/Fantasy-Map-Generator.git synced 2025-12-17 17:51:24 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

refactor(generation): drawCultures start

Browse source
This commit is contained in:
max 2022-07-29 01:20:34 +03:00
parent a832354b48
commit f692f8dfbf
3 changed files with 46 additions and 61 deletions
Download patch file Download diff file Expand all files Collapse all files

54
src/layers/renderers/drawCultures.js
View file

@ -1,54 +0,0 @@
export function drawCultures() {
cults.selectAll("path").remove();
const {cells, vertices, cultures} = pack;
const n = cells.i.length;
const used = new Uint8Array(cells.i.length);
const paths = new Array(cultures.length).fill("");
for (const i of cells.i) {
if (!cells.culture[i]) continue;
if (used[i]) continue;
used[i] = 1;
const c = cells.culture[i];
const onborder = cells.c[i].some(n => cells.culture[n] !== c);
if (!onborder) continue;
const vertex = cells.v[i].find(v => vertices.c[v].some(i => cells.culture[i] !== c));
const chain = connectVertices(vertex, c);
if (chain.length < 3) continue;
const points = chain.map(v => vertices.p[v]);
paths[c] += "M" + points.join("L") + "Z";
}
const data = paths.map((p, i) => [p, i]).filter(d => d[0].length > 10);
cults
.selectAll("path")
.data(data)
.enter()
.append("path")
.attr("d", d => d[0])
.attr("fill", d => cultures[d[1]].color)
.attr("id", d => "culture" + d[1]);
// connect vertices to chain
function connectVertices(start, t) {
const chain = []; // vertices chain to form a path
for (let i = 0, current = start; i === 0 || (current !== start && i < 20000); i++) {
const prev = chain[chain.length - 1]; // previous vertex in chain
chain.push(current); // add current vertex to sequence
const c = vertices.c[current]; // cells adjacent to vertex
c.filter(c => cells.culture[c] === t).forEach(c => (used[c] = 1));
const c0 = c[0] >= n || cells.culture[c[0]] !== t;
const c1 = c[1] >= n || cells.culture[c[1]] !== t;
const c2 = c[2] >= n || cells.culture[c[2]] !== t;
const v = vertices.v[current]; // neighboring vertices
if (v[0] !== prev && c0 !== c1) current = v[0];
else if (v[1] !== prev && c1 !== c2) current = v[1];
else if (v[2] !== prev && c0 !== c2) current = v[2];
if (current === chain[chain.length - 1]) {
ERROR && console.error("Next vertex is not found");
break;
}
}
return chain;
}
}

41
src/layers/renderers/drawCultures.ts Normal file
View file

@ -0,0 +1,41 @@
import {connectVertices} from "scripts/connectVertices";
export function drawCultures() {
/* uses */ const {cells, vertices, cultures} = pack;
cults.selectAll("path").remove(); // cleanup
const used = new Uint8Array(cells.i.length);
const paths = new Array(cultures.length).fill("");
for (const i of cells.i) {
if (!cells.culture[i]) continue;
if (used[i]) continue;
used[i] = 1;
const cultureId = cells.culture[i];
const onborder = cells.c[i].some(n => cells.culture[n] !== cultureId);
if (!onborder) continue;
const startingVertex = cells.v[i].find(v => vertices.c[v].some(i => cells.culture[i] !== cultureId));
if (startingVertex === undefined)
throw new Error(`Draw cultures: starting vertex for culture ${cultureId} is not found`);
const ofSameType = (cellId: number) => cells.culture[cellId] === cultureId;
const chain = connectVertices({vertices, startingVertex, ofSameType});
if (chain.length < 3) continue;
const points = chain.map(v => vertices.p[v]);
paths[cultureId] += "M" + points.join("L") + "Z";
}
const data = paths.map((p, i) => [p, i]).filter(d => d[0].length > 10);
cults
.selectAll("path")
.data(data)
.enter()
.append("path")
.attr("d", d => d[0])
.attr("fill", d => cultures[d[1]].color)
.attr("id", d => "culture" + d[1]);
}

12
src/scripts/connectVertices.ts
View file

@ -17,7 +17,8 @@ export function getFeatureVertices({
const startingCell = findStartingCell({firstCell, featureIds, featureId, vertices, cells, packCellsNumber});
const startingVertex = findStartingVertex({startingCell, featureIds, featureId, vertices, cells, packCellsNumber});
const featureVertices = connectVertices({vertices, startingVertex, featureIds, featureId});
const ofSameType = (cellId: number) => featureIds[cellId] === featureId;
const featureVertices = connectVertices({vertices, startingVertex, ofSameType});
return featureVertices;
}
@ -90,18 +91,15 @@ function findStartingVertex({
const CONNECT_VERTICES_MAX_ITERATIONS = 50000;
// connect vertices around feature
function connectVertices({
export function connectVertices({
vertices,
startingVertex,
featureIds,
featureId
ofSameType
}: {
vertices: IGraphVertices;
startingVertex: number;
featureIds: Uint16Array;
featureId: number;
ofSameType: (cellId: number) => boolean;
}) {
const ofSameType = (cellId: number) => featureIds[cellId] === featureId;
const chain: number[] = []; // vertices chain to form a path
let next = startingVertex;