Balanced Evotree Accumulator
A context free grammar with associated transforms in the plane and RGB space made these...
rules like
a -> bc
b -> bd
but never like:
d -> dd
each symbol is associated with a rotation, shift and scale in the plane, and a step in a direction in he RGB color space.
There are to real terminal symbols, termination occurs when the sub-tree would be less than a pixel in size, and the pixel at the resulting position is coloured.
Much like an L-System, I would say.
Actually because the tree overwrites itself in the image, does that make it context-sensitive, in that the result depends on other symbols? Certainly you need the image buffer as well as the stack to represent the process.
Balanced Evotree Accumulator
A context free grammar with associated transforms in the plane and RGB space made these...
rules like
a -> bc
b -> bd
but never like:
d -> dd
each symbol is associated with a rotation, shift and scale in the plane, and a step in a direction in he RGB color space.
There are to real terminal symbols, termination occurs when the sub-tree would be less than a pixel in size, and the pixel at the resulting position is coloured.
Much like an L-System, I would say.
Actually because the tree overwrites itself in the image, does that make it context-sensitive, in that the result depends on other symbols? Certainly you need the image buffer as well as the stack to represent the process.