|
![](/i/fill.gif) |
On Sat, 28 Dec 2002 21:17:11 -0700, "Kevin Loney" <klo### [at] pt2m com>
wrote:
>I have a mesh, I want to find the smallest possible bounding sphere that
>encompasses all the points.
Check the Graphic Gems collection, there are various algorithms
implemented in Pascal, Assembler and C (and maybe other languages) for
finding the smallest sphere containing n points.
Peter Popov ICQ : 15002700
Personal e-mail : pet### [at] vip bg
TAG e-mail : pet### [at] tag povray org
Post a reply to this message
|
![](/i/fill.gif) |