Nested Divisions of the Plane
The Tree Jive series that I created in 2011–2012 uses a simple L-system, written in Processing, to create tree structures whose branching pattern contains the Fibonacci series. The trees are represented as layers of rectangles. Layers are divided into two populations, based on the L-system rules. Chance operations "prune" the tree, revealing different layers, and the software also permits me to show and hide layers. Color is generated by algorithmic rules. Using the IgnoCodeLib graphics library that I wrote for Processing, I exported the geometric images to Adobe Illustrator, where I continued to work with them, mostly by hiding and showing layers.
The Tree Jive code was first developed from hand drawn images developed from a simple recursive rule. Can one use algorithmic methods not to create complex geometries (though they are good for that), but to create just enough complexity to be mysterious and still highly legible? To create something apparently simple that hides a complex interaction of rules seems to me just as a good a goal for coding as does complexity.