Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!rutgers!umn-d-ub!umn-cs!meccts!viper!dave
From: dave@viper.Lynx.MN.Org (David Messer)
Newsgroups: comp.graphics
Subject: Re: smallest sphere enclosing a set of points
Message-ID: <2999@viper.Lynx.MN.Org>
Date: 13 Dec 89 04:09:43 GMT
References: <28@<Nov- <207400043@s.cs.uiuc.edu> <658@cditi.UUCP> <4893@skinner.nprdc.arpa> <679@dbrmelb.dbrhi.oz>
Reply-To: dave@viper.Lynx.MN.Org (David Messer)
Organization: Lynx Data Systems, Eagan, MN
Lines: 12

If the center of the sphere is the vector C then its radius
is:  r = maximum_for_all_i( |X(i) - C| ) where |X(i) - C| is
the distance from the center to point i.  So all you need to
do is solve dr/dC = 0 to find C.

I leave the calculation of dr/dC as an exercise for the
student.

I hope this clarifies things.  ;->
-- 
Remember Tiananmen Square.           | David Messer       dave@Lynx.MN.Org -or-
                                     | Lynx Data Systems  ...!bungia!viper!dave