Path: utzoo!mnetor!uunet!husc6!bbn!rochester!cornell!batcomputer!sun.soe.clarkson.edu!naughton
From: naughton@sun.soe.clarkson.edu (Patrick Naughton)
Newsgroups: comp.graphics
Subject: Re: Algorithm wanted: Circle enclosing points
Message-ID: <684@sun.soe.clarkson.edu>
Date: 5 Apr 88 01:43:22 GMT
References: <821@sceard.UUCP>
Organization: Clarkson University, Potsdam, NY
Lines: 31

From article <821@sceard.UUCP>, by mrm@sceard.UUCP (M.R.Murphy):
Status: R
 
-> The "center" probably isn't the right terminology. I think it's "centroid"
-> and assuming equal weighting for all points, the centroid is at
-> ((0+2+0+(-2)+1.9)/5,((-2)+0+2+0+1.9)/5). Then after one pass through the data
-> to determine the centroid, you pass through again to find the largest
-> distance from the centroid to any of the points.
-> Using the centroid as the center of a circle, and the largest distance from
-> the centroid to any of the points as the radius...
-> Now the question for the mathematicians out there. Is that the smallest
-> enclosing circle?
-> -- Mike
-> -- 
-> Mike Murphy  Sceard Systems, Inc.  6353C El Camino Real  Carlsbad, CA  92009
-> ARPA: sceard!mrm@nosc.MIL   BITNET: MURPHY@UCLACH
-> UUCP: ucsd!sceard!mrm     INTERNET: mrm%sceard.UUCP@ucsd.ucsd.edu

Wow, another wrong *guess*.  Maybe we should start a new group called
comp.graphics.algorithm.guesswork.  The circle described here is
centered at (0.95,0.95) with a radius of 1.414214, which is obviously
much too large.  (draw it on graph paper...)

This is getting fun...

-Patrick	 ___________________________________________
		|                                           |
		|  Internet: naughton@sun.soe.clarkson.edu  |
		|  BITNET:   naughton@CLUTX.BITNET          |
		|  uucp:     {rpics, gould}!clutx!naughton  |
		|___________________________________________|