Generate path using Lindenmayer system.

Node Data
Display name
L system
Internal name
Node_Path_L_System
Inheritances
Node_Processor
Node_Path_L_System
Inputs
Origin
vec2	Starting Position
vec3	Starting Position
rotation	Starting Angle
Properties
float	Length
rotation	Angle
3D
bool	3D
enum	Forward
rotation	Subangle
Rules
int	Iteration
text	Starting Rule
text	End Replacement
Dynamic Inputs text Name {_Idx} text Rule {_Idx}
Outputs
pathnode	Path

Create path from L-system.

Properties

Lindenmayer System

Lindenmayer Systems (L-system) is a system of drawing line using simple string. The line is drawn from a pointer (sometime called a turtle). The pointer is controlled by a rule containing letters or symbols.

Symbols

Move distance and turn angle are fixed.

Rules Generation

Rules are generated by repeatedly replace a letter with another letter(s). For example.

Applying these rules the first time we will get:

The second iteration will be:

Notice that both rules are being applied at the same time, thus the seconds rule won't replace the letter replaced by the first rule. By repeating these operations many times we can construct more complex rule.

Random Rules

You can also apply multiple rules to the same letter to randomize rule selection.

These rules caused every X to has 50% chance to become F+X and 50% chance to become F-X.

Commit History