Just wanted to let you know on what I've been working. I've finished a first rough (but fully functional) draft of a L-System tree generator. It can be used to generate trees from any imaginable L-System grammar. The trees shown in the screenshot are generated using a very simple grammar with only two rules (it is one of the most basic fractals):
My next step is to combine this generator with Groovy (of course!
) and to integrate some more complex rule sets (like shown here: http://nodebox.net/code/index.php/L-system). I'll also add some randomization to the algorithm (to add variety).
Thinking of... With this approach things like a large "Tree of Life" and mammoth tree forests could become reality in the game.
Code:
Initial axiom: F
F => GG[+F][**+F][//+F]
G => GG
Thinking of... With this approach things like a large "Tree of Life" and mammoth tree forests could become reality in the game.
Attachments
-
1.1 MB Views: 819