Wasn't it Fernando Gonzalez del Cueto who wrote:
>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.

That's a description of "Solution 2" from Kevin's original post. It can
be quite a poor fit in some cases.

-- 
Mike Williams
Gentleman of Leisure

Post a reply to this message

I tried the binary search idea, although I get a very good approximation,
Mike Williams algorithm always gave a better approximation. I actually
considered something similar to your suggested method, I just haven't
scripted it yet. I'll let you know how well it works

Kevin

Post a reply to this message