Christoph Hormann wrote:

> Not really.  I have not used Xfrog but from what i have read the
> technically outstanding thing about it is the possibility to combine
> different predefined elements arbitrarily and adjust their parameters.
> It's a bit like a classical L-System where the replacement rules are not
> fixed but can vary throughout the iteration process. By designing the tree
> the user chooses which replacement rule (from a set supplied, i don't know
> if Xfrog allowes to create own rules) is to be applied where.  And in
> addition you can of course adjust the parameters of the rules.

I agree that there is different algorithm behind each tree generator.
But for me it doesn't matter which algorithm you use if the result is good.

Gena.

Post a reply to this message