"Norbert Kern" <nor### [at] t-onlinede> wrote:
> Hi,
>
> I want to share the first results of my planned plant distribution tool.
>
> In principle it's an solvable problem, see
> http://graphics.stanford.edu/papers/ecosys/ecosys.pdf for a basic procedure
> example.
> First you have to check distances to all neighbors of each plant. Dependent
> of the distance and whether the neighbor is another species or not,
> increase or decrease the size of the plants. A plant will be replaced after
> several iterations or if the size becomes too small.
> The problem is to avoid checking each plant against each other on each
> iteration, because this leads to n*(n-1) checks, if n is the number of
> plants.

Wow, sounds like a neat project.  I have tp try to avoid things like that
these days, otherwise everything else I have to do suffers.  If you want to
do some more technical work on the n*(n-1) problem, have a look at this
recent thread on the random placment of non-intersecting spheres
(http://news.povray.org/povray.advanced-users/thread/%3C446b33a3@news.povray.org%3E/).
 Especially the code I put together which sets up a proximity search and
speeds things up enormously.  Good luck, and I can't wait to see more of
this in action.
-tgq

Post a reply to this message