lot

File*
animate
Docs
Download
What do I make?
log in to save
Machine control
/*
@title: Walkers
@author: ChristopherBody
@snapshot: snapshot0.svg
*/

// Adjustable Variables
const ITERATIONS = 75
const NUMWALKERS = 1000
const WALKERJUMPDISTANCE = 5
const NOISESCALE = 1
const BOUNDARY = 0
const CURVE_SUBDIVISIONS = 10
const doHighest = false
const doEightDir = false
const SEED = 1238721

bt.setRandSeed(SEED);

// Document Size
const width = 125;
const height = 125;
setDocDimensions(width, height);

// Sdf, walkers will walk on this
function sdf(x, y) {
return bt.noise([x * NOISESCALE, y * NOISESCALE]);
}


class walker {
// Motivation is a bias towards going to new cell positions over current ones
constructor(location, motivation, jumpDist, highest, eightDir) {
this.loc = location;
this.mot = motivation;
this.jumpDist = jumpDist
this.points = [this.loc];
this.walkerDone = false;
this.highest = highest;
this.eightDir = eightDir;
}

// Gets the neighbour with either the highest or lowest value, according to getHighest and eightDir (using 4 dirs or eight)
getIdealNeighbour(getHighest, eightDir) {
if (getHighest) {
return this.checkNeighboursHighest(this.loc[0], this.loc[1], eightDir);
} else {
return this.checkNeighboursLowest(this.loc[0], this.loc[1], eightDir);
}
}

// Basic check for eight neighbours, returns highest
checkNeighboursHighest(x, y, eightNeighbours) {
var currentHighest = -Infinity; // Initialize with negative infinity
var idealNeighbour = null;

// Right
if (sdf(x + this.jumpDist, y) > currentHighest) {
currentHighest = sdf(x + this.jumpDist, y);
idealNeighbour = [x + this.jumpDist, y];
}

// Left
if (sdf(x - this.jumpDist, y) > currentHighest) {
currentHighest = sdf(x - this.jumpDist, y);
idealNeighbour = [x - this.jumpDist, y];
}

// Top
if (sdf(x, y + this.jumpDist) > currentHighest) {
currentHighest = sdf(x, y + this.jumpDist);
idealNeighbour = [x, y + this.jumpDist];
}

// Bottom
if (sdf(x, y - this.jumpDist) > currentHighest) {
currentHighest = sdf(x, y - this.jumpDist);
idealNeighbour = [x, y - this.jumpDist];
}
if (eightNeighbours) {
// Top-Right (diagonal)
if (sdf(x + this.jumpDist, y + this.jumpDist) > currentHighest) {
currentHighest = sdf(x + this.jumpDist, y + this.jumpDist);
idealNeighbour = [x + this.jumpDist, y + this.jumpDist];
}

// Top-Left (diagonal)
if (sdf(x - this.jumpDist, y + this.jumpDist) > currentHighest) {
currentHighest = sdf(x - this.jumpDist, y + this.jumpDist);
idealNeighbour = [x - this.jumpDist, y + this.jumpDist];
}

// Bottom-Right (diagonal)
if (sdf(x + this.jumpDist, y - this.jumpDist) > currentHighest) {
currentHighest = sdf(x + this.jumpDist, y - this.jumpDist);
idealNeighbour = [x + this.jumpDist, y - this.jumpDist];
}

// Bottom-Left (diagonal)
if (sdf(x - this.jumpDist, y - this.jumpDist) > currentHighest) {
currentHighest = sdf(x - this.jumpDist, y - this.jumpDist);
idealNeighbour = [x - this.jumpDist, y - this.jumpDist];
}
}
return [currentHighest, idealNeighbour];
}

// same but flipped
checkNeighboursLowest(x, y, eightNeighbours) {
var currentLowest = Infinity; // Initialize with positive infinity
var idealNeighbour = null;

// Right
if (sdf(x + this.jumpDist, y) < currentLowest) {
currentLowest = sdf(x + this.jumpDist, y);
idealNeighbour = [x + this.jumpDist, y];
}

// Left
if (sdf(x - this.jumpDist, y) < currentLowest) {
currentLowest = sdf(x - this.jumpDist, y);
idealNeighbour = [x - this.jumpDist, y];
}

// Top
if (sdf(x, y + this.jumpDist) < currentLowest) {
currentLowest = sdf(x, y + this.jumpDist);
idealNeighbour = [x, y + this.jumpDist];
}

// Bottom
if (sdf(x, y - this.jumpDist) < currentLowest) {
currentLowest = sdf(x, y - this.jumpDist);
idealNeighbour = [x, y - this.jumpDist];
}

if (eightNeighbours) {
// Top-Right (diagonal)
if (sdf(x + this.jumpDist, y + this.jumpDist) < currentLowest) {
currentLowest = sdf(x + this.jumpDist, y + this.jumpDist);
idealNeighbour = [x + this.jumpDist, y + this.jumpDist];
}

// Top-Left (diagonal)
if (sdf(x - this.jumpDist, y + this.jumpDist) < currentLowest) {
currentLowest = sdf(x - this.jumpDist, y + this.jumpDist);
idealNeighbour = [x - this.jumpDist, y + this.jumpDist];
}

// Bottom-Right (diagonal)
if (sdf(x + this.jumpDist, y - this.jumpDist) < currentLowest) {
currentLowest = sdf(x + this.jumpDist, y - this.jumpDist);
idealNeighbour = [x + this.jumpDist, y - this.jumpDist];
}

// Bottom-Left (diagonal)
if (sdf(x - this.jumpDist, y - this.jumpDist) < currentLowest) {
currentLowest = sdf(x - this.jumpDist, y - this.jumpDist);
idealNeighbour = [x - this.jumpDist, y - this.jumpDist];
}
}

return [currentLowest, idealNeighbour];
}

// check if within canvas, bc i'm using curves high curve resolution needed to make sure they don't clip boundaries
isInBounds(pos) {
if (pos[0] > width - BOUNDARY) {
return false;
}
if (pos[0] < BOUNDARY) {
return false;
}
if (pos[1] > height - BOUNDARY) {
return false;
}
if (pos[1] < BOUNDARY) {
return false;
} else {
return true;
}
}

walk(location) {
// consider neighbouring cells
var idealNeighbour, neighbourSdf;
// check ideal neighbour
[neighbourSdf, idealNeighbour] = this.getIdealNeighbour(this.highest, this.eightDir);

if (!this.isInBounds(idealNeighbour)) {
this.walkerDone = true;
}

if (this.highest) {
// add motivation to the sdf, effectively increasing attractiveness
neighbourSdf += this.mot;
//console.log("Current sdf : " + sdf(this.loc[0], this.loc[1]) + "\n Highest Neighbour SDF : " + neighbourSdf);
if (neighbourSdf >= sdf(this.loc[0], this.loc[1])) {
//console.log("NEW HIGHEST NEIGHBOUR " + idealNeighbour);
this.points.push(this.loc);
this.loc = idealNeighbour;
} else {
this.walkerDone = true
}
} else {
// remove motivation to the sdf, effectively increasing attractiveness
neighbourSdf -= this.mot;
if (neighbourSdf <= sdf(this.loc[0], this.loc[1])) {
//console.log("NEW LOWEST NEIGHBOUR " + idealNeighbour);
this.points.push(this.loc);
this.loc = idealNeighbour;
} else {
this.walkerDone = true
}
}
}
}

function main(iterations, numWalkers, walkerJumpDistance) {
var walkers = [];
var points = [];
for (var i = 0; i < numWalkers; i++) {
walkers.push(new walker([bt.randIntInRange(0, width), bt.randIntInRange(0, width)], 0.75, walkerJumpDistance, doHighest, doEightDir));
}
for (var iWalker in walkers) {
//console.log("WALKER : " + walkers[iWalker])
for (var i = 0; i < iterations; i++) {
walkers[iWalker].walk();
if (walkers[iWalker].walkerDone) {
break;
}
}
console.log(walkers[iWalker].points.length)
if (walkers[iWalker].points.length > 3) {
points.push(bt.catmullRom(walkers[iWalker].points, CURVE_SUBDIVISIONS));
}
}
return points;
}

var line = main(ITERATIONS, NUMWALKERS, WALKERJUMPDISTANCE);

//console.log(line)
// draw it
drawLines(line);

The Toolkit

This is a quick reference sheet. For full documentation refer to this.

For an introduction to Blot check out this guide.

Check out our 38 second trailer for a brief overview of the whole Blot project.

There are three names that provide functionality available in the Blot editor: setDocDimensions, drawLines, and blotToolkit (which can also be referenced as bt).

The first two affect the drawing environment itself, and the blotToolkit is used for creating line drawings.

Environment Affecting

setDocDimensions(width: number, height: number)
drawLines(polylines: [number, number][][])

Modify Polylines

Take and modify polylines in place returns first passed polylines.

These functions are available in the blotToolkit or bt object.

bt.iteratePoints(polylines, (pt, t) => { ... }) // return pt to modify, "BREAK" to split, "REMOVE" to filter out point
bt.scale(polylines, scale : scaleXY | [scaleX, scaleY], ?origin: [ x, y ]) 
bt.rotate(polylines, degrees, ?origin: [ x, y ]) 
bt.translate(polylines, [dx, dy], ?origin: [ x, y ]) 
bt.originate(polylines) // moves center to [0, 0] 
bt.resample(polylines, sampleRate) 
bt.simplify(polylines, tolerance) 
bt.trim(polylines, tStart, tEnd)
bt.merge(polylines)  
bt.join(polylines0, ...morePolylines) 
bt.copy(polylines)
bt.cut(polylines0, polylines1) 
bt.cover(polylines0, polylines1) 
bt.union(polylines0, polylines1)
bt.difference(polylines0, polylines1)
bt.intersection(polylines0, polylines1)
bt.xor(polylines0, polylines1)
bt.offset(polylines, delta, ?ops = { endType, joinType, miterLimit, arcTolerance })

Get Data From Polylines

These functions are available in the blotToolkit or bt object.

// take polylines return other
bt.getAngle(polylines, t: [0 to 1]) // returns angle in degrees
bt.getPoint(polylines, t: [0 to 1]) // returns point as [x, y]
bt.getNormal(polylines, t: [0 to 1]) // returns normal vector as [x, y]

bt.pointInside(polylines, pt)

bt.bounds(polylines) 
/*
returns { 
  xMin, xMax, 
  yMin, yMax, 
  lt, ct, rt, 
  lc, cc, rc,
  lb, cb, rb,
  width, height
}

l is left
c is center
r is right
t is top
b is bottom

they are arranged in this configuration around the bounding box of the polylines

lt--ct--rt
 |   |   |
lc--cc--rc
 |   |   | 
lb--cb--rb
*/

Generate Polylines

These functions are available in the blotToolkit or bt object.

const myTurtle = new bt.Turtle()
  .forward(distance: number)
  .arc(angle: number, radius: number)
  .goTo( [ x: number, y: number ] ) // move with up/down state
  .jump( [ x: number, y: number ] ) // move but don't draw
  .step( [ dx: number, dy: number ] ) // add delta to turtles current position
  .right(angle: number)
  .left(angle: number)
  .setAngle(angle: number)
  .up() // sets drawing to false
  .down() // sets drawing to true
  .copy()
  .applyToPath(fn) // takes (turtlePath) => { }
  .lines() // get copy of the Turtle's path

// data
const position = myTurtle.pos // [x: number, y: number]
const angle = myTurtle.angle // number
const path = myTurtle.path // is array of polylines [number, number][][]
const drawing = myTurtle.drawing // boolean
bt.catmullRom(points, ?steps = 1000) // returns polyline [number, number][]
bt.nurbs(points, ?ops = { steps: 100, degree: 2}) // returns polyline [number, number][]

Randomness

These functions are available in the blotToolkit or bt object.

bt.rand();

bt.randInRange(min: number, max: number);

bt.randIntInRange(min: number, max: number); 

bt.setRandSeed(seed: number);

bt.noise(
  number | [ x:number , ?y: number , ?z: number ], 
  { 
    octaves: number [0 to 8], 
    falloff: number [0 to 100] 
  }
);

Idioms

These are small useful code snippets.

function centerPolylines(polylines, documentWidth, documentHeight) {
  const cc = bt.bounds(polylines).cc;
  bt.translate(polylines, [documentWidth / 2, documentHeight / 2], cc);
}