Path: utzoo!mnetor!uunet!lll-winken!lll-tis!ames!oliveb!sun!limes From: limes@sun.uucp (Greg Limes) Newsgroups: comp.graphics Subject: Re: Algorithm wanted: Circle enclosing points Message-ID: <50842@sun.uucp> Date: 26 Apr 88 04:31:46 GMT References: <4306@batcomputer.tn.cornell.edu> Reply-To: limes@sun.UUCP (Greg Limes) Organization: Sun Microsystems, Mountain View Lines: 16 In article jk3k+@andrew.cmu.edu (Joe Keane) writes: >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. > Waitaminnit, the intuition kicks in for half a second and ... is it true that *one* of these two points will be on the smallest circle? and is finding this pair efficient enough to be used to prune out some of the trash while examining triplits? -- Greg Limes [limes@sun.com] frames to /dev/fb