Coding Challenge 34: Diffusion-Limited Aggregation

From the creator

In this coding challenge, I explore the generative algorithm "Diffusion-Limited Aggregation". The pattern is generated from random walkers clustering around a seed (or set of seed) point(s). Code: https://thecodingtrain.com/challenges/34-diffusion-limited-aggregation 🕹️ p5.js Web Editor Sketch: https://editor.p5js.org/codingtrain/sketches/XpS9wGkbB 🎥 Previous video: https://youtu.be/flQgnCUxHlw?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 Next video: https://youtu.be/BAejnwN4Ccw?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH 🎥 All videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6ZiZxtDDRCi6uhfTH4FilpH References: 💾 Atom Live Server Package: https://atom.io/packages/atom-live-server 🔗 Diffusion-Limited Aggregation on Wikipedia: https://en.wikipedia.org/wiki/Diffusion-limited_aggregation 📚 DLA reference: http://paulbourke.net/fractals/dla/ Related Coding Challenges: 🚂 #15 Object-Oriented Fractal Trees: https://youtu.be/fcdNSZ9IzJM 🚂 #52 Random Walker: https://youtu.be/l__fEY1xanY 🚂 #127 Brownian Tree Snowflake: https://youtu.be/XUA8UREROYE Timestamps: 0:00 Welcome to another Coding Challenge 1:10 The DFA algorithm 3:36 Create a tree array 4:30 Create a random walker 8:44 Release multiple walkers at a time 10:11 Create a Walker object 12:39 Create an array of walkers 13:14 Use optional arguments to initialize x and y 15:30 Display the objects in the tree and walker arrays 17:12 Push a walker to the tree array when it gets "stuck" 19:18 Change the color of the walkers that ar

Published 2016-08-18 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.