Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!samsung!munnari.oz.au!murtoa.cs.mu.oz.au!ditmela!pleiades!dbrmelb!davidp
From: davidp@dbrmelb.dbrhi.oz (David Paterson)
Newsgroups: comp.graphics
Subject: Re: smallest sphere enclosing a set of points
Message-ID: <674@dbrmelb.dbrhi.oz>
Date: 4 Dec 89 22:16:51 GMT
References: <28@ <207400043@s.cs.uiuc.edu>
Organization: CSIRO, Div. Building Constr. and Eng'ing, Melb., Australia
Lines: 19
In article <207400043@s.cs.uiuc.edu>, mcooper@s.cs.uiuc.edu writes:
>
> I need the solution for the following problem:
> find the smallest sphere that encloses a set of given points, in both
> 2-D and 3-D (or even n-D, if you like).
>
> 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.
Fails miserably, I used it as a first approximation in the 'fast solution'
method posted to this newsgroup two days ago.
---------------------------------------------------------------------------
David Paterson CSIRO, Highett, 3190, Victoria
'I can't find my car keys'
'You don't have a car'
'Whew, that's a relief, I thought I was becoming forgetful'