Experimenting with L-Systems
With my book out of the way, I’ve found myself with a bit more time to experiment, explore, and play. It’s been a long time! I feel like I’ve almost forgotten how.
I’ve tinkered with some algorithms I’d never played with before, like Bridson’s algorithm for Poisson-disc sampling, and the Bowyer-Watson algorithm for Delaunay triangulation. Those were fun—definitely challenging my limits and teaching me things I’d never considered before.
But while those were intriguing, they weren’t necessarily fun. It’s hard to take those algorithms and play “what-if” games with them. There’s only so much you can do with a Delaunay triangulation, for instance, before it’s just another mesh grid.
So while researching and writing an article for the May issue of PragPub Magazine, I stumbled across this thing called a Lindenmeyer system (or “L-system” for short). I’d played with L-systems before, years ago, back when fractals were ubiquitous and the cool thing to do was to zoom Mandelbrots to the limits of your CPU. I’d never tried to implement these L-systems before, though.
It was time.
So I rolled up my sleeves and went to work, and you know what? This stuff is almost as fun as mazes!
I won’t go into the whole background of L-systems (though it’s worth reading about—who knew a study of algae could lead to a grammar for recursively generating fractals?). The gist of it is this: you start with some initial string, and then repeatedly apply transformations to it until the string is some desired length. Then you interpret the string as a series of commands (turtle-style) that draw the final pattern.
Here’s a concrete example. Let’s say you start with the string
FX. To transform this string, we’ll replace each instance of
X+YF+, and (because we’ve introduced a
Y there) we’ll replace
-FX-Y. The other symbols (
-) we’ll leave untouched.
So, after a few iterations, our string grows like this. (Parentheses are used to indicate expansions, and aren’t actually part of the grammar, here.)
And so forth. (You can see that the string grows long quite rapidly!)
But so what? Well, look: treat those symbols in the string as turtle graphic commands, right? Let
F mean “move forward”,
+ mean “turn right 90 degrees”, and `-‘ mean “turn left 90 degrees” (and ignore all the other symbols). Those strings become descriptions of curves! In this case, if you let the string get long enough, it becomes a fractal known as the Dragon curve. The following was created by applying the transformation 14 times in succession:
Well, this totally tickles my inner geek. (And I’ll be the first to admit, my inner geek is not buried very deeply at all.) I mean, heck, not only does this have the word fractal in it, it also has grammar, curve, and transformation, and suggests things like parser and interpreter. I gotta say—I kind of love those things.
And look at all the ways you can experiment with this! I mean, you can start just by fiddling with the transformation rules, right? What if you switch a
- for a
+, or go whole-hog and replace an entire substitution rule? You can get all kinds of interesting effects. But you can go even further! Who’s to say that a turn needs to be 90 degrees? Or that left and right turns need to be symmetrical? What if you add more operations, like push and pop to save and restore the turtle’s position?
Well, you wind up with beautiful fractals like this one:
This is a seaweed pattern I grabbed off the Internet, which uses an initial starting string of
F, and a substitution rule that changes every
FF-[-F+F+F]+[+F-F-F]. (Those square brackets represent “push” and “pop” operations.)
But you know what really makes me giggle? This whole thing is ridiculously easy to implement. The computer scientist in me had to try and abstract things all out, but here’s a bare bones implementation that illustrates the basic idea.
I’ll be playing with this stuff for a while, I’m sure, discovering and rediscovering things that others probably stumbled across years and years ago, and enjoying every minute of it. The entire premise of “what if I change this one small thing” is just so compelling!
If you’re interested in tinkering, too, I’d encourage you to try your hand at implementing an L-system processor. Or, if you’re impatient to just jump in and start playing with fractals, you can grab what I’ve done so far, a simple library I’m calling “Lindy”, at https://github.com/jamis/lindy.