Path: utzoo!mnetor!uunet!husc6!mailrus!ames!eos!jbm
From: jbm@eos.UUCP (Jeffrey Mulligan)
Newsgroups: comp.graphics
Subject: Re: Algorithm wanted: Circle enclosing points
Message-ID: <499@eos.UUCP>
Date: 5 Apr 88 19:36:17 GMT
References: <4306@batcomputer.tn.cornell.edu>
Organization: NASA Ames Research Center, California
Lines: 17

From article <4306@batcomputer.tn.cornell.edu>, by garry@batcomputer.tn.cornell.edu (Garry Wiegand):

> Exhaustive search for this problem is probably O(n^3). I conjecture 
> that the two points which are *farthest apart* will lie on the smallest 
> circle.

counterexample:

If the desired circle is contains 3 points at the vertices of an equilateral
triangle, there can be pairs of interior points whose distance approaches
the diameter. 

-- 

	Jeff Mulligan (jbm@ames-aurora.arpa)
	NASA/Ames Research Ctr., Mail Stop 239-3, Moffet Field CA, 94035
	(415) 694-5150