Featured

Pong in 240 Favicons - Psychedelic Graphics - XOR Deep Dive - JesseSort: a New Sorting Algo - History of Algorithmic Composition - Size Coding Botto - Intricacies of a Calculator App - Bluesky's Lossy Timelines - NASA's 10 Rules for Software Development - Creativity and AI - LLM from Scratch

In this post we revisit our particle system, and have a first look at the Verlet Integration method, which is an alternate method for simulating particle physics. It is in many ways more robust that the regular Euler Integration method that we have employed so far.

In this post we have a look at a simple algorithmic idea that can produce some very interesting organic looking patterns. At it's essence it's a circle packing strategy, but with the added twist that these circles are connected in a tree like structure. 🌳🦠

Sketches are more than just little artworks that you hack together in your bedroom. They're ongoing conversations that you have with the yourself and the machine. It's important to explore them, gain new perspectives and ultimately contribute to something larger than yourself.

In this post we'll work our way towards an algorithm that can compute convex polygon intersections. We'll also explore a method for intersections between axis-aligned rectangles, a function that can determine the intersection of two line segments, as well as a point in polygon test.

Shape packing is a popular type of sketch in gen-art, but is often trickier than it might seem when you try to pack anything more complicated than a simple circle. In this post we'll have a look what goes into collision detection as well as a strategy to pack any arbitrary shape in 2D.

The Bowyer-Watson algorithm for Delaunay triangulation is maybe one of the easier methods to implement and understand for obtaining a Delaunay Triangulation.