|
|
Xplo Eristotle wrote:
> Dan P wrote:
>
>> Xplo Eristotle wrote:
>>
>>> Because of the random nature of the code and the need to test against
>>> every other tree when placing a new one,
>>
>>
>> A more recursive, fractal approach might help cull the amount of trees
>> you need to test against. How a "plasma" fractal is created might help
>> you build the algorithm:
>
>
> I don't see what use this could possibly be. But then, it's possible
> that the math that would make its application obvious is over my head.
> *shrug*
It's a matter of finding a way to limit the size of your arrays by
slicing the the scene up into smaller and smaller cubes by using
recursion to some pre-defined limit.
--
Respectfully,
Dan P
http://<broken link>
Post a reply to this message
|
|