Mike Williams wrote:

> I suspect that you're doing something silly that's taking all that time.

Perhaps.

> This was done with a simplistic collision detection, just like that which
> you describe, with no clever bounding or other tricks.
> I didn't count placement failures, I just chose a sensible number of trees
> to be placed by doing a previous run with a #debug that logs the number of
> successful placements.

I'm rather curious how you're doing your collision detection. Even when 
choosing "a sensible number of trees", I would expect a much longer 
parse time based on my testing so far, due to the number of collision 
tests I have to make.

-Xplo

Post a reply to this message