Packing circles into a finite space is fun. Especially when you use lazy algorithms that place and test, rather than do any hard math. One such classic algorithm is this, place a very small circle into a field and grow that circle until it hits another circle or the edge. Repeat until no room is left for new circles. This generates many, many circles.
In this new implementation, circles are now inside other circles. They go all the way down until there is no room. There are also some indications of which circles have touched, but this requires more exploration.
Programmed in Processing
In Albuquerque, New Mexico
Date unknown
