✳flâneur — a map of the web's best reading

L-System manual

paulbourke.net · 2,408 words · saved by 1 readers

This program implements some of the L-Systems discussed in "Lecture Notes in Biomathematics" by Przemyslaw Prusinkiewcz and James Hanan. A brief description of an 0L system will be presented here but for a more complete description the user should consult the literature. The application was initially written to investigate methods of incorporating objects with a large number of drawing elements (lines, polygons) into a CAD package. L Systems is one way for example of "generating" trees at the rendering stage but not during the editing stage where the image complexity will slow down the response time. A string of characters (symbols) is rewritten on each iteration according to some replacement rules. Consider an initial string (axiom) and a rewriting rule After one iteration the following string would result For the next iteration the same rule is applied but now to the string resulting from the last iteration Some symbols are now given a graphical meaning, for example, F means move for

L-System manual L-System User Notes (Lindenmayer Systems) Written by Paul Bourke Version 2.5, July 1991 Introduction This program implements some of the L-Systems discussed in "Lecture Notes in Biomathematics" by Przemyslaw Prusinkiewcz and James Hanan. A brief description of an 0L system will be presented here but for a more complete description the user should consult the literature. The application was initially written to investigate methods of incorporating objects with a large number of drawing elements (lines, polygons) into a CAD package. L Systems is one way for example of "generating

Explore this link on the map →

saved by

related reading