treedef

Table


 * — (string) initial tree axiom
 * — (string) rules set A
 * — (string) rules set B
 * — (string) rules set C
 * — (string) rules set D
 * — (string) trunk node name
 * — (string) leaves node name
 * — (string) secondary leaves node name
 * — (num) chance (0-100) to replace leaves with leaves2
 * — (num) angle in deg
 * — (num) max # of iterations, usually 2 -5
 * — (num) factor to lower nr of iterations, usually 0 - 3
 * — (string) one of the following:
 * — 1 node
 * — 2x2 nodes
 * — 3x3 nodes in cross shape


 * — (boolean) true -> use thin (1 node) branches
 * — (string) fruit node name
 * — (num) chance (0-100) to replace leaves with fruit node
 * — (num) random seed