|
 |
"Slime" <noo### [at] hotmail com> wrote:
> I have come up with an algorithm that, although it is still O(n^2), can
> place 16,000 spheres in, if I remember correctly, 13 minutes in the POV SDL.
> It gets faster, of course, when the spheres are less densely placed. In this
> example, about one out of every ten spheres needed more than one placement
> to find a place that didn't intersect with other spheres.
Sounds interesting ...
could you tell me the idea of the algo?
what are the test you do, and what are the constraints of the spheres placed ?
Post a reply to this message
|
|
