// Differential Growth — an organic curve that outgrows its own space // space = reseed, drag = push the membrane let nodes = []; let ghost; let grid; let hueBase = 190; const DESIRED = 9; // preferred spacing between nodes const REPEL_R = 17; // repulsion radius const MAX_EDGE = 13; // split edges longer than this const MAX_NODES = 2600; function setup() { createCanvas(windowWidth, windowHeight); colorMode(HSB, 360, 100, 100, 1); ghost = createGraphics(width, height); ghost.colorMode(HSB, 360, 100, 100, 1); ghost.clear(); reseed(); } function windowResized() { resizeCanvas(windowWidth, windowHeight); ghost = createGraphics(width, height); ghost.colorMode(HSB, 360, 100, 100, 1); ghost.clear(); reseed(); } function reseed() { nodes = []; hueBase = random(360); const n = 36; const r = min(width, height) * 0.06; for (let i = 0; i < n; i++) { const a = (TWO_PI * i) / n; nodes.push( createVector(width / 2 + cos(a) * r, height / 2 + sin(a) * r * 0.9) ); } if (ghost) ghost.clear(); } function buildGrid() { grid = new Map(); for (let i = 0; i < nodes.length; i++) { const cx = Math.floor(nodes[i].x / REPEL_R); const cy = Math.floor(nodes[i].y / REPEL_R); const k = cx + ',' + cy; let bucket = grid.get(k); if (!bucket) { bucket = []; grid.set(k, bucket); } bucket.push(i); } } function step() { const N = nodes.length; if (N < 3) return; buildGrid(); const cx0 = width / 2; const cy0 = height / 2; const bound = min(width, height) * 0.46; const forces = new Array(N); for (let i = 0; i < N; i++) { const cur = nodes[i]; const prev = nodes[(i - 1 + N) % N]; const next = nodes[(i + 1) % N]; const f = createVector(0, 0); // --- spring attraction toward neighbours --- for (const nb of [prev, next]) { const d = p5.Vector.sub(nb, cur); const len = d.mag(); if (len > 0.0001) { d.mult(((len - DESIRED) * 0.22) / len); f.add(d); } } // --- smoothing toward the midpoint of neighbours --- const mid = p5.Vector.add(prev, next).mult(0.5); f.add(mid.sub(cur).mult(0.14)); // --- repulsion from nearby nodes (spatial hash) --- const gx = Math.floor(cur.x / REPEL_R); const gy = Math.floor(cur.y / REPEL_R); for (let ox = -1; ox <= 1; ox++) { for (let oy = -1; oy <= 1; oy++) { const bucket = grid.get((gx + ox) + ',' + (gy + oy)); if (!bucket) continue; for (let b = 0; b < bucket.length; b++) { const j = bucket[b]; if (j === i) continue; const dx = cur.x - nodes[j].x; const dy = cur.y - nodes[j].y; const d2 = dx * dx + dy * dy; if (d2 > REPEL_R * REPEL_R || d2 < 0.0001) continue; const d = Math.sqrt(d2); const w = (1 - d / REPEL_R) * 1.35; f.x += (dx / d) * w; f.y += (dy / d) * w; } } } // --- gentle containment --- const dcx = cur.x - cx0; const dcy = cur.y - cy0; const dc = Math.sqrt(dcx * dcx + dcy * dcy); if (dc > bound) { const pull = (dc - bound) * 0.05; f.x -= (dcx / dc) * pull; f.y -= (dcy / dc) * pull; } // --- mouse pressure --- if (mouseIsPressed) { const mx = cur.x - mouseX; const my = cur.y - mouseY; const md = Math.sqrt(mx * mx + my * my); if (md < 90 && md > 0.001) { const w = (1 - md / 90) * 3.2; f.x += (mx / md) * w; f.y += (my / md) * w; } } // --- a whisper of noise so growth stays irregular --- const nz = noise(cur.x * 0.004, cur.y * 0.004, frameCount * 0.004); const ang = nz * TWO_PI * 3; f.x += cos(ang) * 0.11; f.y += sin(ang) * 0.11; f.limit(1.6); forces[i] = f; } for (let i = 0; i < N; i++) nodes[i].add(forces[i]); // --- subdivision: edges that stretch too far spawn new nodes --- if (nodes.length < MAX_NODES) { for (let i = nodes.length - 1; i >= 0; i--) { const a = nodes[i]; const b = nodes[(i + 1) % nodes.length]; if (p5.Vector.dist(a, b) > MAX_EDGE) { nodes.splice(i + 1, 0, p5.Vector.add(a, b).mult(0.5)); } } // occasional spontaneous insertion keeps the growth asymmetric if (random() < 0.5 && nodes.length < MAX_NODES) { const i = floor(random(nodes.length)); const a = nodes[i]; const b = nodes[(i + 1) % nodes.length]; const m = p5.Vector.add(a, b).mult(0.5); m.add(p5.Vector.random2D().mult(0.6)); nodes.splice(i + 1, 0, m); } } } function traceShape(g, closeIt) { g.beginShape(); g.curveVertex(nodes[nodes.length - 1].x, nodes[nodes.length - 1].y); for (let i = 0; i < nodes.length; i++) g.curveVertex(nodes[i].x, nodes[i].y); g.curveVertex(nodes[0].x, nodes[0].y); g.curveVertex(nodes[1].x, nodes[1].y); g.endShape(closeIt ? CLOSE : undefined); } function draw() { for (let s = 0; s < 2; s++) step(); // stamp a faint memory of the current outline if (frameCount % 14 === 0 && nodes.length > 4) { ghost.noFill(); ghost.strokeWeight(1); ghost.stroke((hueBase + nodes.length * 0.06) % 360, 55, 95, 0.075); traceShape(ghost, true); } background(222, 38, 7); image(ghost, 0, 0); if (nodes.length > 4) { // body: slightly darker than the ghosts so the loop reads as solid noStroke(); fill(224, 45, 9, 0.82); traceShape(this, true); // living edge noFill(); strokeWeight(1.4); stroke((hueBase + nodes.length * 0.06) % 360, 45, 100, 0.9); traceShape(this, true); // nodes glimmer strokeWeight(1); stroke((hueBase + 40) % 360, 30, 100, 0.25); for (let i = 0; i < nodes.length; i += 7) point(nodes[i].x, nodes[i].y); } noStroke(); fill(0, 0, 100, 0.35); textSize(11); textFont('monospace'); text('nodes ' + nodes.length + ' [space] reseed [drag] push', 14, height - 14); } function keyPressed() { if (key === ' ') reseed(); }

Claude Opus 5

Differential Growth