2c:null 2d:["$","title",null,{"children":"Original Code by Martin O'Leary @mewo2 | folcon | Observable"}] 32:T187c,mesh = { function makeSRNG(start){ var seed = start; function random() { var x = Math.sin(seed++) * 10000; return x - Math.floor(x); } return random; // Math.random; } let rand = makeSRNG(1); function runif(lo, hi) { return lo + rand() * (hi - lo); } let rnorm = (function () { var z2 = null; function rnorm() { if (z2 != null) { var tmp = z2; z2 = null; return tmp; } var x1 = 0; var x2 = 0; var w = 2.0; while (w >= 1) { x1 = runif(-1, 1); x2 = runif(-1, 1); w = x1 * x1 + x2 * x2; } w = Math.sqrt(-2 * Math.log(w) / w); z2 = x2 * w; return x1 * w; } return rnorm; })(); function randomVector(scale) { return [scale * rnorm(), scale * rnorm()]; } let defaultExtent = { width: 1, height: 1 } function generatePoints(n, extent) { extent = extent || defaultExtent; var pts = []; for (var i = 0; i < n; i++) { pts.push([(rand() - 0.5) * extent.width, (rand() - 0.5) * extent.height]); } return pts; } function centroid(pts) { var x = 0; var y = 0; for (var i = 0; i < pts.length; i++) { x += pts[i][0]; y += pts[i][1]; } return [x/pts.length, y/pts.length]; } function improvePoints(pts, n, extent) { n = n || 1; extent = extent || defaultExtent; for (var i = 0; i < n; i++) { pts = voronoi(pts, extent) .polygons(pts) .map(centroid); } return pts; } function generateGoodPoints(n, extent) { extent = extent || defaultExtent; var pts = generatePoints(n, extent); pts = pts.sort(function (a, b) { return a[0] - b[0]; }); return improvePoints(pts, 1, extent); } function voronoi(pts, extent) { extent = extent || defaultExtent; var w = extent.width/2; var h = extent.height/2; return d3_old.voronoi().extent([[-w, -h], [w, h]])(pts); } function makeMesh(pts, extent) { extent = extent || defaultExtent; var vor = voronoi(pts, extent); var vxs = []; var vxids = {}; var adj = []; var edges = []; var tris = []; console.log("vor.edges", vor.edges); for (var i = 0; i < vor.edges.length; i++) { var e = vor.edges[i]; if (e == undefined) continue; var e0 = vxids[e[0]]; var e1 = vxids[e[1]]; if (e0 == undefined) { e0 = vxs.length; vxids[e[0]] = e0; vxs.push(e[0]); } if (e1 == undefined) { e1 = vxs.length; vxids[e[1]] = e1; vxs.push(e[1]); } adj[e0] = adj[e0] || []; adj[e0].push(e1); adj[e1] = adj[e1] || []; adj[e1].push(e0); edges.push([e0, e1, e.left, e.right]); tris[e0] = tris[e0] || []; if (!tris[e0].includes(e.left)) tris[e0].push(e.left); if (e.right && !tris[e0].includes(e.right)) tris[e0].push(e.right); tris[e1] = tris[e1] || []; if (!tris[e1].includes(e.left)) tris[e1].push(e.left); if (e.right && !tris[e1].includes(e.right)) tris[e1].push(e.right); } var mesh = { pts: pts, vor: vor, vxs: vxs, adj: adj, tris: tris, edges: edges, extent: extent } mesh.map = function (f) { var mapped = vxs.map(f); mapped.mesh = mesh; return mapped; } return mesh; } function cone(mesh, slope) { return mesh.map(function (x) { return Math.pow(x[0] * x[0] + x[1] * x[1], 0.5) * slope; }); } function slope(mesh, direction) { return mesh.map(function (x) { return x[0] * direction[0] + x[1] * direction[1]; }); } function mountains(mesh, n, r) { r = r || 0.05; var mounts = []; for (var i = 0; i < n; i++) { mounts.push([mesh.extent.width * (rand() - 0.5), mesh.extent.height * (rand() - 0.5)]); } var newvals = zero(mesh); for (var i = 0; i < mesh.vxs.length; i++) { var p = mesh.vxs[i]; for (var j = 0; j < n; j++) { var m = mounts[j]; newvals[i] += Math.pow(Math.exp(-((p[0] - m[0]) * (p[0] - m[0]) + (p[1] - m[1]) * (p[1] - m[1])) / (2 * r * r)), 2); } } return newvals; } function add() { var n = arguments[0].length; var newvals = zero(arguments[0].mesh); for (var i = 0; i < n; i++) { for (var j = 0; j < arguments.length; j++) { newvals[i] += arguments[j][i]; } } return newvals; } function zero(mesh) { var z = []; for (var i = 0; i < mesh.vxs.length; i++) { z[i] = 0; } z.mesh = mesh; return z; } function makeD3Path(path) { var p = d3.path(); p.moveTo(path[0][0], path[0][1]); for (var i = 1; i < path.length; i++) { p.lineTo(path[i][0], path[i][1]); } return p.toString(); } function visualizeVoronoi(svg, field, lo, hi) { if (hi == undefined) hi = d3.max(field) + 1e-9; if (lo == undefined) lo = d3.min(field) - 1e-9; var mappedvals = field.map(function (x) {return x > hi ? 1 : x < lo ? 0 : (x - lo) / (hi - lo)}); var tris = svg.selectAll('path.field').data(field.mesh.tris) tris.enter() .append('path') .classed('field', true); tris.exit() .remove(); svg.selectAll('path.field') .attr('d', makeD3Path) .style('fill', function (d, i) { return d3.interpolateViridis(mappedvals[i]); }); } return {defaultExtent: defaultExtent, generatePoints: generatePoints, generateGoodPoints: generateGoodPoints, runif: runif, voronoi: voronoi, makeMesh: makeMesh, zero: zero, randomVector: randomVector, slope: slope, cone: cone, add: add, visualizeVoronoi: visualizeVoronoi} }33:T178b,delaunay_chart_try_1 = { const svg = d3.create("svg") .attr("viewBox", [-width/2, -height/2, width, height]) .attr("stroke-width", 2); function voronoi(pts, extent) { var w = extent.width/2; var h = extent.height/2; return d3_old.voronoi().extent([[-w, -h], [w, h]])(pts); } function deluany(pts, extent) { var w = extent.width/2; var h = extent.height/2; return d3.Delaunay.from(pts).voronoi([-w, -h, w, h]) } function nextHalfedge(e) { return (e % 3 === 2) ? e - 2 : e + 1; } function forEachTriangleEdge(points, delaunay) { let edges = []; for (let e = 0; e < delaunay.triangles.length; e++) { if (e > delaunay.halfedges[e]) { const p = points[delaunay.triangles[e]]; const to = nextHalfedge(e); const q = points[delaunay.triangles[to]]; edges.push({curr:e, next:to, left:p, right:q}); } } return edges; } function edgesOfTriangle(t) { return [3 * t, 3 * t + 1, 3 * t + 2]; } function pointsOfTriangle(delaunay, t) { return edgesOfTriangle(t) .map(e => delaunay.triangles[e]); } function forEachTriangle(points, delaunay) { var tris = []; for (let t = 0; t < delaunay.triangles.length / 3; t++) { // tris[t] = pointsOfTriangle(delaunay, t).map(p => points[p]); tris[t] = pointsOfTriangle(delaunay, t).map(function(p){ return {"idx":p, "vtx":points[p]}}); console.log("triangle:", t, pointsOfTriangle(delaunay, t).map(function(p){ return {"idx":p, "vtx":points[p]}})); } return tris; } function circumcenter(a, b, c) { const ad = a[0] * a[0] + a[1] * a[1]; const bd = b[0] * b[0] + b[1] * b[1]; const cd = c[0] * c[0] + c[1] * c[1]; const D = 2 * (a[0] * (b[1] - c[1]) + b[0] * (c[1] - a[1]) + c[0] * (a[1] - b[1])); return [ 1 / D * (ad * (b[1] - c[1]) + bd * (c[1] - a[1]) + cd * (a[1] - b[1])), 1 / D * (ad * (c[0] - b[0]) + bd * (a[0] - c[0]) + cd * (b[0] - a[0])), ]; } function triangleCenter(points, delaunay, t) { const vertices = pointsOfTriangle(delaunay, t).map(p => points[p]); return circumcenter(vertices[0], vertices[1], vertices[2]); } function triangleOfEdge(e) { return Math.floor(e / 3); } function trianglesAdjacentToTriangle(delaunay, t) { const adjacentTriangles = []; for (const e of edgesOfTriangle(t)) { const opposite = delaunay.halfedges[e]; if (opposite >= 0) { adjacentTriangles.push(triangleOfEdge(opposite)); } } return adjacentTriangles; } function forEachVoronoiEdge(points, delaunay) { let edges = []; for (let e = 0; e < delaunay.triangles.length; e++) { if (e < delaunay.halfedges[e]) { const from = triangleOfEdge(e); const to = triangleOfEdge(delaunay.halfedges[e]) const p = triangleCenter(points, delaunay, from); const q = triangleCenter(points, delaunay, to); edges.push({e:e, from:from, to:to, p:p, q:q}); } } return edges; } function makeDelaunayMesh(pts, extent) { var vor = voronoi(pts, extent); var delu = deluany(pts, extent); console.log("vor",vor); console.log("delu",delu, delu.delaunay.halfedges); // var triangleEdges = forEachTriangleEdge(pts, delu.delaunay); // console.log("triangleEdges:", triangleEdges); var triangles = forEachTriangle(pts, delu.delaunay); //forEachVoronoiEdge(pts, delu.delaunay, console.log); var vxs = []; // ~circumcenters, differences possibly due to cutting var vxids = {}; var adj = []; var edges = []; // seems like triangle edges? var tris = []; var triangleEdges = []; for (var i = 0; i < triangles.length; i++) { var t = triangles[i]; triangleEdges.push([t[0],t[1]]); triangleEdges.push([t[1],t[2]]); triangleEdges.push([t[2],t[0]]); tris.push(t.map(p => p.vtx)); } console.log("triangleEdges:", triangleEdges); for (var i = 0; i < triangleEdges.length; i++) { var e = triangleEdges[i]; if (e == undefined) continue; console.log("ee", e); // console.log("adj-tri", trianglesAdjacentToTriangle(delu.delaunay, e.curr)); var e0 = e[0]; var e1 = e[1]; vxs[e0.idx] = e0.vtx; vxs[e1.idx] = e1.vtx; adj[e0.idx] = adj[e0.idx] || []; adj[e0.idx].push(e1.idx); adj[e1.idx] = adj[e1.idx] || []; adj[e1.idx].push(e0.idx); edges.push([e0.idx, e1.idx, e0.vtx, e1.vtx]); } var mesh = { pts: pts, delu: delu, vxs: vxs, adj: adj, tris: tris, edges: edges, extent: extent } mesh.map = function (f) { var mapped = vxs.map(f); mapped.mesh = mesh; return mapped; } return mesh; } let map_mesh = makeDelaunayMesh(points, extent); console.log("map_mesh", mesh.makeMesh(points, extent)); console.log("new_mesh", map_mesh); let map_hm = mesh.add( mesh.slope(map_mesh, mesh.randomVector(4)), mesh.cone(map_mesh, mesh.runif(-1, -1)) ); console.log("del_map_hm", map_hm); const circle = svg.append("g") .selectAll("circle") .data(points) .join("circle") .attr("cx", d => d[0]) .attr("cy", d => d[1]) .attr("r", 4) mesh.visualizeVoronoi(svg, map_hm); // const vorii = deluany(points, extent); // const prior_mesh = svg.append("path") // .attr("fill", "none") // .attr("d", vorii.render()); // const prior_cells = svg.append("g") // .selectAll("path") // .data(points) // .join("path") // .style('fill', function (d, i) { // return d3.interpolateViridis(i); // }) // .style("stroke", "#fff") // .style("stroke-width", 2) // .attr("d", (d, i) => vorii.renderCell(i)); return svg.node(); }34:T1dd1,// Attempt to go from leftmost point and then walk around edges, this seems like the right idea, but the ordering is wrong... delaunay_chart_try_2 = { const svg = d3.create("svg") .attr("viewBox", [-width/2, -height/2, width, height]) .attr("stroke-width", 2); function voronoi(pts, extent) { var w = extent.width/2; var h = extent.height/2; return d3_old.voronoi().extent([[-w, -h], [w, h]])(pts); } function deluany(pts, extent) { var w = extent.width/2; var h = extent.height/2; return d3.Delaunay.from(pts).voronoi([-w, -h, w, h]) } function nextHalfedge(e) { return (e % 3 === 2) ? e - 2 : e + 1; } function forEachTriangleEdge(points, delaunay) { let edges = []; for (let e = 0; e < delaunay.triangles.length; e++) { if (e > delaunay.halfedges[e]) { const p = points[delaunay.triangles[e]]; const to = nextHalfedge(e); const q = points[delaunay.triangles[to]]; edges.push({curr:e, next:to, left:p, right:q}); } } return edges; } function edgesOfTriangle(t) { return [3 * t, 3 * t + 1, 3 * t + 2]; } function pointsOfTriangle(delaunay, t) { return edgesOfTriangle(t) .map(e => delaunay.triangles[e]); } function forEachTriangle(points, delaunay) { var tris = []; for (let t = 0; t < delaunay.triangles.length / 3; t++) { // tris[t] = pointsOfTriangle(delaunay, t).map(p => points[p]); tris[t] = pointsOfTriangle(delaunay, t).map(function(p){ return {"idx":p, "vtx":points[p]}}); console.log("triangle:", t, pointsOfTriangle(delaunay, t).map(function(p){ return {"idx":p, "vtx":points[p]}})); } return tris; } function circumcenter(a, b, c) { const ad = a[0] * a[0] + a[1] * a[1]; const bd = b[0] * b[0] + b[1] * b[1]; const cd = c[0] * c[0] + c[1] * c[1]; const D = 2 * (a[0] * (b[1] - c[1]) + b[0] * (c[1] - a[1]) + c[0] * (a[1] - b[1])); return [ 1 / D * (ad * (b[1] - c[1]) + bd * (c[1] - a[1]) + cd * (a[1] - b[1])), 1 / D * (ad * (c[0] - b[0]) + bd * (a[0] - c[0]) + cd * (b[0] - a[0])), ]; } function triangleCenter(points, delaunay, t) { const vertices = pointsOfTriangle(delaunay, t).map(p => points[p]); return circumcenter(vertices[0], vertices[1], vertices[2]); } function triangleOfEdge(e) { return Math.floor(e / 3); } function edgesAroundPoint(delaunay, start) { const result = []; let incoming = start; do { result.push(incoming); const outgoing = nextHalfedge(incoming); incoming = delaunay.halfedges[outgoing]; } while (incoming !== -1 && incoming !== start); return result; } function forEachVoronoiCell(points, delaunay, callback) { var cells = []; const index = new Map(); // point id to half-edge id for (let e = 0; e < delaunay.triangles.length; e++) { const endpoint = delaunay.triangles[nextHalfedge(e)]; if (!index.has(endpoint) || delaunay.halfedges[e] === -1) { index.set(endpoint, e); } } for (let p = 0; p < points.length; p++) { const incoming = index.get(p); const edges = edgesAroundPoint(delaunay, incoming); const triangles = edges.map(triangleOfEdge); const lefts = triangles; const rights = edges.map(e => delaunay.halfedges[e]); const vertices = triangles.map(t => triangleCenter(points, delaunay, t)); callback("p:", p, "\nedges:", edges, "\ntriangles:", triangles, "\nvertices:", vertices, "\nlefts", lefts, "\nrights", rights); cells.push({"p":p, "edges": edges, "triangles":triangles, "vertices": vertices, "lefts":lefts, "rights":rights}); } return cells; } function triangle_start_point(points, delaunay, t) { // return pointsOfTriangle(delaunay, t).map(p => points[p]) return points[delaunay.triangles[t]]; } function makeCellMesh(pts, extent) { var delu = deluany(pts, extent); console.log("delu",delu, delu.delaunay.halfedges); var cells = forEachVoronoiCell(pts, delu.delaunay, console.log); var vxs = []; // ~circumcenters, differences possibly due to cutting var vxids = {}; var adj = []; var edges = []; // seems like triangle edges? var tris = []; for (var c = 0; c < cells.length; c++) { var cell = cells[c]; console.log("CELLS!", cell); // create edges using vertices! So loop around the cell, using modulo to return to the start! for (var i = 0; i < cell.edges.length; i++) { var E0 = cell.vertices[i]; var E1 = cell.vertices[(i+1)%cell.edges.length]; var E_left_idx = cell.lefts[i]; var E_right_idx = cell.rights[i]; var E_left = undefined; if(E_left != -1){ E_left = triangle_start_point(pts, delu.delaunay, E_left_idx); } var E_right = undefined; if(E_right_idx != -1){ E_right = triangle_start_point(pts, delu.delaunay, E_right_idx); }; console.log("E0", E0, "E1", E1, "\nE_left", E_left_idx, E_left, "\nE_right", E_right_idx, E_right); var e0 = vxids[E0]; var e1 = vxids[E1]; if (e0 == undefined) { e0 = vxs.length; vxids[E0] = e0; vxs.push(E0); } if (e1 == undefined) { e1 = vxs.length; vxids[E1] = e1; vxs.push(E1); } adj[e0] = adj[e0] || []; if (!adj[e0].includes(e1)) adj[e0].push(e1); adj[e1] = adj[e1] || []; if (!adj[e1].includes(e0)) adj[e1].push(e0); edges.push([e0, e1, E_left, E_right]); tris[e0] = tris[e0] || []; if (!tris[e0].includes(E_left)) tris[e0].push(E_left); if (E_right && !tris[e0].includes(E_right)) tris[e0].push(E_right); tris[e1] = tris[e1] || []; if (!tris[e1].includes(E_left)) tris[e1].push(E_left); if (E_right && !tris[e1].includes(E_right)) tris[e1].push(E_right); } } var mesh = { pts: pts, delu: delu, vxs: vxs, adj: adj, tris: tris, edges: edges, extent: extent } mesh.map = function (f) { var mapped = vxs.map(f); mapped.mesh = mesh; return mapped; } return mesh; } let map_mesh = makeCellMesh(points, extent); console.log("map_mesh", mesh.makeMesh(points, extent)); console.log("new_mesh", map_mesh); let map_hm = mesh.add( mesh.slope(map_mesh, mesh.randomVector(4)), mesh.cone(map_mesh, mesh.runif(-1, -1)) ); console.log("del_map_hm", map_hm); const circle = svg.append("g") .selectAll("circle") .data(points) .join("circle") .attr("cx", d => d[0]) .attr("cy", d => d[1]) .attr("r", 4) mesh.visualizeVoronoi(svg, map_hm); // const vorii = deluany(points, extent); // const prior_mesh = svg.append("path") // .attr("fill", "none") // .attr("d", vorii.render()); // const prior_cells = svg.append("g") // .selectAll("path") // .data(points) // .join("path") // .style('fill', function (d, i) { // return d3.interpolateViridis(i); // }) // .style("stroke", "#fff") // .style("stroke-width", 2) // .attr("d", (d, i) => vorii.renderCell(i)); return svg.node(); }35:T1136,BinaryHeap = { // // A binary heap (from eloquentjavascript.net). // By default, implements a min heap. By defining scoreFunction // other behaviors can be implemented. For instance function (x) { return -x } can // be used to define a max heap. // function BinaryHeap(scoreFunction){ this.content = []; this.scoreFunction = scoreFunction || function (x) { return x }; } BinaryHeap.prototype = { // // Adds a new element to the heap // push: function(element) { // Add the new element to the end of the array. this.content.push(element); // Allow it to bubble up. this.bubbleUp(this.content.length - 1); }, // // Removes the top of the heap and returns it // pop: function() { // Store the first element so we can return it later. var result = this.content[0]; // Get the element at the end of the array. var end = this.content.pop(); // If there are any elements left, put the end element at the // start, and let it sink down. if (this.content.length > 0) { this.content[0] = end; this.sinkDown(0); } return result; }, // // Removes a given value from the heap. // remove: function(node) { var length = this.content.length; // To remove a value, we must search through the array to find // it. for (var i = 0; i < length; i++) { if (this.content[i] != node) continue; // When it is found, the process seen in 'pop' is repeated // to fill up the hole. var end = this.content.pop(); // If the element we popped was the one we needed to remove, // we're done. if (i == length - 1) break; // Otherwise, we replace the removed element with the popped // one, and allow it to float up or sink down as appropriate. this.content[i] = end; this.bubbleUp(i); this.sinkDown(i); break; } }, // // Returns the number of elements of the heap // size: function() { return this.content.length; }, // // Moves element at position n towards the top as necessary bubbleUp: function(n) { // Fetch the element that has to be moved. var element = this.content[n], score = this.scoreFunction(element); // When at 0, an element can not go up any further. while (n > 0) { // Compute the parent element's index, and fetch it. var parentN = Math.floor((n + 1) / 2) - 1, parent = this.content[parentN]; // If the parent has a lesser score, things are in order and we // are done. if (score >= this.scoreFunction(parent)) break; // Otherwise, swap the parent with the current element and // continue. this.content[parentN] = element; this.content[n] = parent; n = parentN; } }, // // Moves element at position n towards the bottom as necessary sinkDown: function(n) { // Look up the target element and its score. var length = this.content.length, element = this.content[n], elemScore = this.scoreFunction(element); while(true) { // Compute the indices of the child elements. var child2N = (n + 1) * 2, child1N = child2N - 1; // This is used to store the new position of the element, // if any. var swap = null; // If the first child exists (is inside the array)... if (child1N < length) { // Look it up and compute its score. var child1 = this.content[child1N], child1Score = this.scoreFunction(child1); // If the score is less than our element's, we need to swap. if (child1Score < elemScore) swap = child1N; } // Do the same checks for the other child. if (child2N < length) { var child2 = this.content[child2N], child2Score = this.scoreFunction(child2); if (child2Score < (swap == null ? elemScore : child1Score)) swap = child2N; } // No need to swap further, we are done. if (swap == null) break; // Otherwise, swap and continue. this.content[n] = this.content[swap]; this.content[swap] = element; n = swap; } } } return BinaryHeap }36:T4cce,complete_mesh = { function makeSRNG(start){ var seed = start; function random() { var x = Math.sin(seed++) * 10000; return x - Math.floor(x); } return random; // Math.random; } let rand = makeSRNG(1); function runif(lo, hi) { return lo + rand() * (hi - lo); } let rnorm = (function () { var z2 = null; function rnorm() { if (z2 != null) { var tmp = z2; z2 = null; return tmp; } var x1 = 0; var x2 = 0; var w = 2.0; while (w >= 1) { x1 = runif(-1, 1); x2 = runif(-1, 1); w = x1 * x1 + x2 * x2; } w = Math.sqrt(-2 * Math.log(w) / w); z2 = x2 * w; return x1 * w; } return rnorm; })(); function randomVector(scale) { return [scale * rnorm(), scale * rnorm()]; } let defaultExtent = { width: 1, height: 1 } function generatePoints(n, extent) { extent = extent || defaultExtent; var pts = []; for (var i = 0; i < n; i++) { pts.push([(rand() - 0.5) * extent.width, (rand() - 0.5) * extent.height]); } return pts; } function centroid(pts) { var x = 0; var y = 0; for (var i = 0; i < pts.length; i++) { x += pts[i][0]; y += pts[i][1]; } return [x/pts.length, y/pts.length]; } function improvePoints(pts, n, extent) { n = n || 1; extent = extent || defaultExtent; for (var i = 0; i < n; i++) { pts = voronoi(pts, extent) .polygons(pts) .map(centroid); } return pts; } function generateGoodPoints(n, extent) { extent = extent || defaultExtent; var pts = generatePoints(n, extent); pts = pts.sort(function (a, b) { return a[0] - b[0]; }); return improvePoints(pts, 1, extent); } function voronoi(pts, extent) { extent = extent || defaultExtent; var w = extent.width/2; var h = extent.height/2; return d3_old.voronoi().extent([[-w, -h], [w, h]])(pts); } function makeMesh(pts, extent) { extent = extent || defaultExtent; var vor = voronoi(pts, extent); var vxs = []; var vxids = {}; var adj = []; var edges = []; var tris = []; console.log("vor.edges", vor.edges); for (var i = 0; i < vor.edges.length; i++) { var e = vor.edges[i]; if (e == undefined) continue; var e0 = vxids[e[0]]; var e1 = vxids[e[1]]; if (e0 == undefined) { e0 = vxs.length; vxids[e[0]] = e0; vxs.push(e[0]); } if (e1 == undefined) { e1 = vxs.length; vxids[e[1]] = e1; vxs.push(e[1]); } adj[e0] = adj[e0] || []; adj[e0].push(e1); adj[e1] = adj[e1] || []; adj[e1].push(e0); edges.push([e0, e1, e.left, e.right]); tris[e0] = tris[e0] || []; if (!tris[e0].includes(e.left)) tris[e0].push(e.left); if (e.right && !tris[e0].includes(e.right)) tris[e0].push(e.right); tris[e1] = tris[e1] || []; if (!tris[e1].includes(e.left)) tris[e1].push(e.left); if (e.right && !tris[e1].includes(e.right)) tris[e1].push(e.right); } var mesh = { pts: pts, vor: vor, vxs: vxs, adj: adj, tris: tris, edges: edges, extent: extent } mesh.map = function (f) { var mapped = vxs.map(f); mapped.mesh = mesh; return mapped; } return mesh; } function cone(mesh, slope) { return mesh.map(function (x) { return Math.pow(x[0] * x[0] + x[1] * x[1], 0.5) * slope; }); } function slope(mesh, direction) { return mesh.map(function (x) { return x[0] * direction[0] + x[1] * direction[1]; }); } function mountains(mesh, n, r) { r = r || 0.05; var mounts = []; for (var i = 0; i < n; i++) { mounts.push([mesh.extent.width * (rand() - 0.5), mesh.extent.height * (rand() - 0.5)]); } var newvals = zero(mesh); for (var i = 0; i < mesh.vxs.length; i++) { var p = mesh.vxs[i]; for (var j = 0; j < n; j++) { var m = mounts[j]; newvals[i] += Math.pow(Math.exp(-((p[0] - m[0]) * (p[0] - m[0]) + (p[1] - m[1]) * (p[1] - m[1])) / (2 * r * r)), 2); } } return newvals; } function add() { var n = arguments[0].length; var newvals = zero(arguments[0].mesh); for (var i = 0; i < n; i++) { for (var j = 0; j < arguments.length; j++) { newvals[i] += arguments[j][i]; } } return newvals; } function zero(mesh) { var z = []; for (var i = 0; i < mesh.vxs.length; i++) { z[i] = 0; } z.mesh = mesh; return z; } function isedge(mesh, i) { return (mesh.adj[i].length < 3); } function isnearedge(mesh, i) { var x = mesh.vxs[i][0]; var y = mesh.vxs[i][1]; var w = mesh.extent.width; var h = mesh.extent.height; return x < -0.45 * w || x > 0.45 * w || y < -0.45 * h || y > 0.45 * h; } function neighbours(mesh, i) { var onbs = mesh.adj[i]; var nbs = []; for (var i = 0; i < onbs.length; i++) { nbs.push(onbs[i]); } return nbs; } function relax(h) { var newh = zero(h.mesh); for (var i = 0; i < h.length; i++) { var nbs = neighbours(h.mesh, i); if (nbs.length < 3) { newh[i] = 0; continue; } newh[i] = d3.mean(nbs.map(function (j) {return h[j]})); } return newh; } function map(h, f) { var newh = h.map(f); newh.mesh = h.mesh; return newh; } function normalize(h) { var lo = d3.min(h); var hi = d3.max(h); return map(h, function (x) {return (x - lo) / (hi - lo)}); } function peaky(h) { return map(normalize(h), Math.sqrt); } function fillSinks(h, epsilon) { epsilon = epsilon || 1e-5; var infinity = 999999; var newh = zero(h.mesh); for (var i = 0; i < h.length; i++) { if (isnearedge(h.mesh, i)) { newh[i] = h[i]; } else { newh[i] = infinity; } } while (true) { var changed = false; for (var i = 0; i < h.length; i++) { if (newh[i] == h[i]) continue; var nbs = neighbours(h.mesh, i); for (var j = 0; j < nbs.length; j++) { if (h[i] >= newh[nbs[j]] + epsilon) { newh[i] = h[i]; changed = true; break; } var oh = newh[nbs[j]] + epsilon; if ((newh[i] > oh) && (oh > h[i])) { newh[i] = oh; changed = true; } } } if (!changed) return newh; } } function downhill(h) { if (h.downhill) return h.downhill; function downfrom(i) { if (isedge(h.mesh, i)) return -2; var best = -1; var besth = h[i]; var nbs = neighbours(h.mesh, i); for (var j = 0; j < nbs.length; j++) { if (h[nbs[j]] < besth) { besth = h[nbs[j]]; best = nbs[j]; } } return best; } var downs = []; for (var i = 0; i < h.length; i++) { downs[i] = downfrom(i); } h.downhill = downs; return downs; } function getFlux(h) { var dh = downhill(h); var idxs = []; var flux = zero(h.mesh); for (var i = 0; i < h.length; i++) { idxs[i] = i; flux[i] = 1/h.length; } idxs.sort(function (a, b) { return h[b] - h[a]; }); for (var i = 0; i < h.length; i++) { var j = idxs[i]; if (dh[j] >= 0) { flux[dh[j]] += flux[j]; } } return flux; } function trislope(h, i) { var nbs = neighbours(h.mesh, i); if (nbs.length != 3) return [0,0]; var p0 = h.mesh.vxs[nbs[0]]; var p1 = h.mesh.vxs[nbs[1]]; var p2 = h.mesh.vxs[nbs[2]]; var x1 = p1[0] - p0[0]; var x2 = p2[0] - p0[0]; var y1 = p1[1] - p0[1]; var y2 = p2[1] - p0[1]; var det = x1 * y2 - x2 * y1; var h1 = h[nbs[1]] - h[nbs[0]]; var h2 = h[nbs[2]] - h[nbs[0]]; return [(y2 * h1 - y1 * h2) / det, (-x2 * h1 + x1 * h2) / det]; } function getSlope(h) { var dh = downhill(h); var slope = zero(h.mesh); for (var i = 0; i < h.length; i++) { var s = trislope(h, i); slope[i] = Math.sqrt(s[0] * s[0] + s[1] * s[1]); } return slope; } function erosionRate(h) { var flux = getFlux(h); var slope = getSlope(h); var newh = zero(h.mesh); for (var i = 0; i < h.length; i++) { var river = Math.sqrt(flux[i]) * slope[i]; var creep = slope[i] * slope[i]; var total = 1000 * river + creep; total = total > 200 ? 200 : total; newh[i] = total; } return newh; } function erode(h, amount) { var er = erosionRate(h); var newh = zero(h.mesh); var maxr = d3.max(er); for (var i = 0; i < h.length; i++) { newh[i] = h[i] - amount * (er[i] / maxr); } return newh; } function doErosion(h, amount, n) { n = n || 1; h = fillSinks(h); for (var i = 0; i < n; i++) { h = erode(h, amount); h = fillSinks(h); } return h; } function quantile(h, q) { var sortedh = []; for (var i = 0; i < h.length; i++) { sortedh[i] = h[i]; } sortedh.sort(d3.ascending); return d3.quantile(sortedh, q); } function setSeaLevel(h, q) { var newh = zero(h.mesh); var delta = quantile(h, q); for (var i = 0; i < h.length; i++) { newh[i] = h[i] - delta; } return newh; } function cleanCoast(h, iters) { for (var iter = 0; iter < iters; iter++) { var changed = 0; var newh = zero(h.mesh); for (var i = 0; i < h.length; i++) { newh[i] = h[i]; var nbs = neighbours(h.mesh, i); if (h[i] <= 0 || nbs.length != 3) continue; var count = 0; var best = -999999; for (var j = 0; j < nbs.length; j++) { if (h[nbs[j]] > 0) { count++; } else if (h[nbs[j]] > best) { best = h[nbs[j]]; } } if (count > 1) continue; newh[i] = best / 2; changed++; } h = newh; newh = zero(h.mesh); for (var i = 0; i < h.length; i++) { newh[i] = h[i]; var nbs = neighbours(h.mesh, i); if (h[i] > 0 || nbs.length != 3) continue; var count = 0; var best = 999999; for (var j = 0; j < nbs.length; j++) { if (h[nbs[j]] <= 0) { count++; } else if (h[nbs[j]] < best) { best = h[nbs[j]]; } } if (count > 1) continue; newh[i] = best / 2; changed++; } h = newh; } return h; } // I've explicitly modified mergeSegments from the original as it doesn't seem it works consistently? // Turns out comparing arrays in js is not straightforward? // function eq(array1, array2) {return array1.length === array2.length && array1.every((value, index) => value === array2[index])} function eq(array1, array2) { return array1 == array2 } function mergeSegments(segs) { var adj = {}; for (var i = 0; i < segs.length; i++) { var seg = segs[i]; var a0 = adj[seg[0]] || []; var a1 = adj[seg[1]] || []; a0.push(seg[1]); a1.push(seg[0]); adj[seg[0]] = a0; adj[seg[1]] = a1; } var done = []; var paths = []; var path = null; while (true) { if (path == null) { for (var i = 0; i < segs.length; i++) { if (done[i]) continue; done[i] = true; path = [segs[i][0], segs[i][1]]; break; } if (path == null) break; } var changed = false; for (var i = 0; i < segs.length; i++) { if (done[i]) continue; if (adj[path[0]].length == 2 && eq(segs[i][0], path[0])) { path.unshift(segs[i][1]); } else if (adj[path[0]].length == 2 && eq(segs[i][1], path[0])) { path.unshift(segs[i][0]); } else if (adj[path[path.length - 1]].length == 2 && eq(segs[i][0], path[path.length - 1])) { path.push(segs[i][1]); } else if (adj[path[path.length - 1]].length == 2 && eq(segs[i][1], path[path.length - 1])) { path.push(segs[i][0]); } else { continue; } done[i] = true; changed = true; break; } if (!changed) { paths.push(path); path = null; } } return paths; } function contour(h, level) { level = level || 0; var edges = []; for (var i = 0; i < h.mesh.edges.length; i++) { var e = h.mesh.edges[i]; if (e[3] == undefined) continue; if (isnearedge(h.mesh, e[0]) || isnearedge(h.mesh, e[1])) continue; if ((h[e[0]] > level && h[e[1]] <= level) || (h[e[1]] > level && h[e[0]] <= level)) { edges.push([e[2], e[3]]); } } return mergeSegments(edges); } function relaxPath(path) { var newpath = [path[0]]; for (var i = 1; i < path.length - 1; i++) { var newpt = [0.25 * path[i-1][0] + 0.5 * path[i][0] + 0.25 * path[i+1][0], 0.25 * path[i-1][1] + 0.5 * path[i][1] + 0.25 * path[i+1][1]]; newpath.push(newpt); } newpath.push(path[path.length - 1]); return newpath; } function getRivers(h, limit) { var dh = downhill(h); var flux = getFlux(h); var links = []; var above = 0; for (var i = 0; i < h.length; i++) { if (h[i] > 0) above++; } limit *= above / h.length; for (var i = 0; i < dh.length; i++) { if (isnearedge(h.mesh, i)) continue; if (flux[i] > limit && h[i] > 0 && dh[i] >= 0) { var up = h.mesh.vxs[i]; var down = h.mesh.vxs[dh[i]]; if (h[dh[i]] > 0) { links.push([up, down]); } else { links.push([up, [(up[0] + down[0])/2, (up[1] + down[1])/2]]); } } } return mergeSegments(links).map(relaxPath); } function getSlopeLines(render) { var h = render.h; var strokes = []; var r = 0.25 / Math.sqrt(h.length); for (var i = 0; i < h.length; i++) { if (h[i] <= 0 || isnearedge(h.mesh, i)) continue; var nbs = neighbours(h.mesh, i); nbs.push(i); var s = 0; var s2 = 0; for (var j = 0; j < nbs.length; j++) { var slopes = trislope(h, nbs[j]); s += slopes[0] / 10; s2 += slopes[1]; } s /= nbs.length; s2 /= nbs.length; if (Math.abs(s) < runif(0.1, 0.4)) continue; var l = r * runif(1, 2) * (1 - 0.2 * Math.pow(Math.atan(s), 2)) * Math.exp(s2/100); var x = h.mesh.vxs[i][0]; var y = h.mesh.vxs[i][1]; if (Math.abs(l*s) > 2 * r) { var n = Math.floor(Math.abs(l*s/r)); l /= n; if (n > 4) n = 4; for (var j = 0; j < n; j++) { var u = rnorm() * r; var v = rnorm() * r; strokes.push([[x+u-l, y+v+l*s], [x+u+l, y+v-l*s]]); } } else { strokes.push([[x-l, y+l*s], [x+l, y-l*s]]); } } return strokes; } function visualizeSlopes(svg, render) { var strokes = getSlopeLines(render); console.log("strokes:", strokes); var lines = svg.selectAll('line.slope').data(strokes); lines.enter() .append('line') .classed('slope', true); lines.exit() .remove(); svg.selectAll('line.slope') .attr('x1', function (d) {return d[0][0]}) .attr('y1', function (d) {return d[0][1]}) .attr('x2', function (d) {return d[1][0]}) .attr('y2', function (d) {return d[1][1]}) } var pq = new BinaryHeap (function (dpi) { return -dpi.dist; }); function makeD3Path(path) { var p = d3.path(); p.moveTo(path[0][0], path[0][1]); for (var i = 1; i < path.length; i++) { p.lineTo(path[i][0], path[i][1]); } return p.toString(); } function visualizeVoronoi(svg, field, lo, hi) { if (hi == undefined) hi = d3.max(field) + 1e-9; if (lo == undefined) lo = d3.min(field) - 1e-9; var mappedvals = field.map(function (x) {return x > hi ? 1 : x < lo ? 0 : (x - lo) / (hi - lo)}); var tris = svg.selectAll('path.field').data(field.mesh.tris) tris.enter() .append('path') .classed('field', true); tris.exit() .remove(); svg.selectAll('path.field') .attr('d', makeD3Path) .style('fill', function (d, i) { return d3.interpolateViridis(mappedvals[i]); }); } function drawPaths(svg, cls, paths) { var paths = svg.selectAll('path.' + cls).data(paths) paths.enter() .append('path') .classed(cls, true) paths.exit() .remove(); svg.selectAll('path.' + cls) .attr('d', makeD3Path); } var colour_fn = d3.scaleLinear() .domain([0, 0.02, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1]) .range(['blue', 'yellow', 'brown', 'brown', 'lightgreen', 'green', 'darkgreen', 'green', 'green', 'white']) .interpolate(d3.interpolateHcl) function visualiseMapColours(svg, field, lo, hi) { if (hi == undefined) hi = d3.max(field) + 1e-9; if (lo == undefined) lo = d3.min(field) - 1e-9; var mappedvals = field.map(function (x) {return x > hi ? 1 : x < lo ? 0 : (x - lo) / (hi - lo)}); var tris = svg.selectAll('path.field').data(field.mesh.tris) tris.enter() .append('path') .classed('field', true); tris.exit() .remove(); svg.selectAll('path.field') .attr('d', makeD3Path) .style('fill', function (d, i) { return colour_fn(mappedvals[i]); }); } function visualizePhysicalMap(svg, heightmap) { drawPaths(svg, "coast", contour(heightmap, 0)); drawPaths(svg, "river", getRivers(heightmap, 0.01)); visualizeSlopes(svg, {h:heightmap}); } return {defaultExtent: defaultExtent, generatePoints: generatePoints, generateGoodPoints: generateGoodPoints, runif: runif, voronoi: voronoi, makeMesh: makeMesh, zero: zero, randomVector: randomVector, slope: slope, cone: cone, mountains: mountains, add: add, relax: relax, peaky: peaky, erosionRate: erosionRate, doErosion: doErosion, setSeaLevel: setSeaLevel, fillSinks: fillSinks, cleanCoast: cleanCoast, visualizeVoronoi: visualizeVoronoi, visualiseMapColours: visualiseMapColours, visualizePhysicalMap: visualizePhysicalMap} }37:[] 30:{"id":"1c558b51b849c2b2","slug":"original-code-by-martin-oleary-mewo2","title":"Original Code by Martin O'Leary @mewo2","thumbnail":"040f1c53a1873256b0e3bfa80567045aa4b27f3489cdb0469138f41dd1510c99","access_level":"public","create_time":"$D2020-05-22T19:54:35.335Z","update_time":"$D2020-05-25T21:05:34.675Z","view_time":null,"first_public_time":"$D2020-05-23T02:58:52.378Z","has_unpublished_edits":null,"fork":false,"stars":1,"starred":false,"owner":{"type":"team","id":"1b402750dafedf73","login":"folcon","name":"","avatar_url":"https://avatars-next.observableusercontent.com/cc493dcde7b89a0c84d10ab840039adf2fb85e578f2c234b29dbc162853208d7","tier":"starter_2024","bio":""},"version":202,"publish_version":202,"role":null,"authored":false,"authors":[{"type":"individual","id":"7c5fa8cb30866d0f","login":"folcon","name":"","avatar_url":"https://avatars-next.observableusercontent.com/cc493dcde7b89a0c84d10ab840039adf2fb85e578f2c234b29dbc162853208d7","tier":null,"bio":""}],"members":[{"type":"individual","id":"7c5fa8cb30866d0f","login":"folcon","name":"","avatar_url":"https://avatars-next.observableusercontent.com/cc493dcde7b89a0c84d10ab840039adf2fb85e578f2c234b29dbc162853208d7","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":1,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Original Code by Martin O'Leary @mewo2","cells":[{"id":0,"value":"md`# [Original Code](http://mewo2.com/notes/terrain/) by Martin O'Leary [@mewo2](https://twitter.com/mewo2)\n## with helpful [notes](https://mewo2.com/notes/terrain/)\nI'm just trying to work out how to port it to use Delaunator =)...`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"d3 = require(\"d3@5\", \"d3-delaunay@5\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":6,"value":"d3_old = require(\"d3@4\", \"d3-voronoi\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"$32","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":16,"value":"width = 954","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":20,"value":"height = 1000","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":11,"value":"extent = ({width: width, height: height});","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":22,"value":"points = mesh.generateGoodPoints(1024, extent);\n// points = mesh.generateGoodPoints(8, extent);\n// points = mesh.generateGoodPoints(4096, extent);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":51,"value":"md`## Goal, to get correct mapping between vertices, heightmap and triangles, to produce these smooth colour transitions.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":25,"value":"original_voronoi_chart = {\n const svg = d3.create(\"svg\")\n .attr(\"viewBox\", [-width/2, -height/2, width, height])\n .attr(\"stroke-width\", 2);\n let map_mesh = mesh.makeMesh(points, extent);\n let map_hm = mesh.add(\n mesh.slope(map_mesh, mesh.randomVector(4)),\n mesh.cone(map_mesh, mesh.runif(-1, -1))\n );\n const circle = svg.append(\"g\")\n .selectAll(\"circle\")\n .data(points)\n .join(\"circle\")\n .attr(\"cx\", d => d[0])\n .attr(\"cy\", d => d[1])\n .attr(\"r\", 4)\n mesh.visualizeVoronoi(svg, map_hm);\n return svg.node();\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":57,"value":"md`## Useful Notes / Assumptions:\nThe mesh uses the edges of the cells, not the triangles for \"edges\", if you look at the adj (adjacencies) it's never higher than 3, which is in keeping with using the cells as each vertex of the cell has no more than 3 neighbours.\n\nGiven that an edge is an edge of a cell, the left and the right of the edge should therefore be the two cells that edge sits on.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":28,"value":"md`## Most of the code comes from the Delaunator Datastructures Guide \"https://mapbox.github.io/delaunator/\"`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":27,"value":"$33","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":41,"value":"$34","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":73,"value":"md`# Complete Example using the full pipeline (mewo2's original code so once the makeMesh function works, this should work):`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":158,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":88,"value":"$36","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":78,"value":"original_voronoi_complete_hm = {\n let map_mesh = complete_mesh.makeMesh(points, extent);\n let map_hm = complete_mesh.add(\n complete_mesh.slope(map_mesh, complete_mesh.randomVector(4)),\n complete_mesh.cone(map_mesh, complete_mesh.runif(-1, -1)),\n complete_mesh.mountains(map_mesh, 50)\n );\n for (var i = 0; i < 10; i++) {\n map_hm = complete_mesh.relax(map_hm);\n }\n map_hm = complete_mesh.peaky(map_hm);\n map_hm = complete_mesh.doErosion(map_hm, complete_mesh.runif(0, 0.1), 5);\n map_hm = complete_mesh.setSeaLevel(map_hm, complete_mesh.runif(0.2, 0.6));\n map_hm = complete_mesh.fillSinks(map_hm);\n map_hm = complete_mesh.cleanCoast(map_hm, 3);\n return map_hm;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":99,"value":"original_voronoi_complete_voronoi = {\n const svg = d3.create(\"svg\")\n .attr(\"viewBox\", [-width/2, -height/2, width, height])\n .attr(\"stroke-width\", 2);\n complete_mesh.visualizeVoronoi(svg, original_voronoi_complete_hm);\n return svg.node();\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":104,"value":"original_voronoi_complete_erosion = {\n const svg = d3.create(\"svg\")\n .attr(\"viewBox\", [-width/2, -height/2, width, height])\n .attr(\"stroke-width\", 2);\n complete_mesh.visualizeVoronoi(svg, complete_mesh.erosionRate(original_voronoi_complete_hm), 0, 1);\n return svg.node();\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":149,"value":"html`\n\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":114,"value":"original_voronoi_complete_physical_map = {\n const svg = d3.create(\"svg\").attr('class', 'physical-map')\n .attr(\"viewBox\", [-width/2, -height/2, width, height])\n .attr(\"stroke-width\", 2).style('background-color', 'white');\n complete_mesh.visualizeVoronoi(svg, original_voronoi_complete_hm, 0)\n complete_mesh.visualizePhysicalMap(svg, original_voronoi_complete_hm);\n return svg.node();\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":152,"value":"original_voronoi_complete_geo_map = {\n const svg = d3.create(\"svg\").attr('class', 'real-map')\n .attr(\"viewBox\", [-width/2, -height/2, width, height])\n .attr(\"stroke-width\", 2).style('background-color', 'white');\n //complete_mesh.visualizeVoronoi(svg, original_voronoi_complete_hm, 0)\n complete_mesh.visualiseMapColours(svg, original_voronoi_complete_hm, 0)\n complete_mesh.visualizePhysicalMap(svg, original_voronoi_complete_hm);\n return svg.node();\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W37","stdlib":"1"}} 31:"$30:body"