Voronoi and the Strange Comfort of Nearest Neighbors
The Voronoi sketch looks calm for about three seconds, then it starts feeling alive. You place one point and the plane cleaves around it, you place another and every border renegotiates, and soon the whole field behaves like a tiny republic that keeps redrawing its map with each new citizen. The core rule is brutally simple because each cell owns the pixels that are closer to its seed than to any other seed, but simplicity does not make it boring, it makes it legible, and legibility is half the magic in creative coding. When people say a system has structure, this is what they usually mean, a rule you can explain in one breath that still surprises you in motion.
I did a quick grounding pass before writing this, and the historical line is cleaner than most internet retellings. Dirichlet gave the early formal treatment in the nineteenth century, then Georgy Voronoi generalized the construction across dimensions in work published around 1907 to 1908, which is why modern references still wobble on the exact year while agreeing on the mathematics. That same nearest-neighbor partition shows up in rainfall maps, network coverage, materials science, and epidemic modeling, so the sketch is not a toy pretending to be serious science, it is serious science that happens to produce beautiful geometry in a browser tab. If you want to run it yourself, the artifact is here Voronoi Tessellation, and the full collection lives at the Gallery Index.
← Back to main page