Path: utzoo!mnetor!uunet!husc6!bloom-beacon!mit-eddie!bbn!rochester!PT.CS.CMU.EDU!andrew.cmu.edu!jk3k+ From: jk3k+@andrew.cmu.edu (Joe Keane) Newsgroups: comp.graphics Subject: Re: Algorithm wanted: Circle enclosing points Message-ID: Date: 9 Apr 88 13:42:26 GMT References: <4306@batcomputer.tn.cornell.edu> Organization: Carnegie Mellon University Lines: 18 In-Reply-To: <4306@batcomputer.tn.cornell.edu> In article <4306@batcomputer.tn.cornell.edu>, garry@batcomputer.tn.cornell.edu (Garry Wiegand) writes: > I conjecture that the two points which are *farthest apart* will lie on the > smallest circle. 'Fraid not. Suppose A=(0,-2), B=(1,3), X=(-1,-2), Y=(3,0), and Z=(-1,3). Then A and B are farthest apart but the smallest circle is XYZ. -1 0 1 2 3 3 Z B 2 1 0 Y -1 -2 X A --Joe