Java Lindenmayer Systems
|Op. System:||Windows XP/2000/98|
|File size:||277 KB|
Publisher description for Java Lindenmayer Systems
Java Lindenmayer Systems is a desktop program written to process Lindenmeyer Systems. It has been written entirely in Java. Thus, it should run on any operating system. The user interface allows multiple inner windows to compare different graphs to each other. It also allows saving of the graphs as JPG or PNG images. Lindenmayer Systems are part of fractal math. In essence, they are interested in describing that the world is self-replicating. For example, a simplified tree can be described as the main log separating into 3 big branches. The big branches separate into 3 medium branches etc. Thus, repetition 3 branches, which each separate into three more branches and so force. Or, the growth of a bacteria population can be described as a young bateria maturing in stage 1. In stage 2, the mature bacteria splits into two young bacteria. Stage 3, has two young bacteria maturing. The self-replicating behavior is described basically using string re-writing. It starts with an axiom, a series of letters. Then there is a set of rules, which describe a new letter (or multiple) that each letter in the original string should be replaced with. Repeating these translations (or permutations) in the end will build the structure of a big tree with hundreds of branches out of the simple starting rules. The second Aspect of Lindenmeyer systems are rules to render the strings graphically. They are based on Turtle graphics.