Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!mentor.cc.purdue.edu!gkd
From: gkd@mentor.cc.purdue.edu (Keith Miyake)
Newsgroups: comp.graphics
Subject: Re: smallest sphere enclosing a set of
Summary: faulty algorithm
Message-ID: <5539@mentor.cc.purdue.edu>
Date: 2 Dec 89 19:08:27 GMT
Expires: 2 Dec 89 19:08:27 GMT
References: <28@ <207400043@s.cs.uiuc.edu>
Reply-To: gkd@mentor.cc.purdue.edu (Keith Miyake)
Distribution: usa
Organization: Purdue University
Lines: 18
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.
>
This does not work, I thought of this as a possible solution also, but it
is flawed. Consider the event of having a equilateral triangle -only 3
points. Then using this method, you will always exclude one point, since
you take the midpoint of one of the edges.
It seems that this can be accounted for and a circle/sphere can be found
using this algorithm, but I haven't thought about the specifics of it.
Keith
miyake@cs.purdue.edu