I don't know if this is a good approach, but I think it can be very fast:

Find the bounding box, which is "cheap", and now find the smallest sphere
that includes this box.

I think it really is up to your code to decide if it is worth to use a more
exhaustive approach (and more expensive), if that would speed up other parts
of your code.

I hope this helps,

Fernando.

Post a reply to this message