Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!tut.cis.ohio-state.edu!rutgers!uwvax!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
Message-ID: <2986@viper.Lynx.MN.Org>
Date: 7 Dec 89 14:45:24 GMT
References: <28@<Nov> <207400043@s.cs.uiuc.edu>
Reply-To: dave@viper.Lynx.MN.Org (David Messer)
Organization: Lynx Data Systems, Eagan, MN
Lines: 15

In article <207400043@s.cs.uiuc.edu> mcooper@s.cs.uiuc.edu writes:
 >
 >take set of point and compute distances from every point to every other point.
 >find the two points which are farthest away from one another.  1/2 the
 >distance between them is the diameter of your enclosing circle/sphere.  Center
 >your circle/sphere on the halfway point of the line between them.
 >
 >disclaimer-  This is simply an intuitve solution that came up.  It may or may 
 >not have serious flaws.  any comments?

Try it for three points in an equalateral (sp?) triangle...
doesn't work.
-- 
Remember Tiananmen Square.           | David Messer       dave@Lynx.MN.Org -or-
                                     | Lynx Data Systems  ...!bungia!viper!dave