Xref: utzoo comp.theory:495 comp.sources.wanted:11083 sci.math:10389 sci.math.num-analysis:666 Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!hp4nl!eurtrx!euraiv1!reino From: reino@cs.eur.nl (Reino de Boer) Newsgroups: comp.theory,comp.sources.wanted,sci.math,sci.math.num-analysis Subject: Re: Smallest circle around n points in space. Keywords: circle, distance, math, algorithms Message-ID: <1990Mar22.195123.2849@cs.eur.nl> Date: 22 Mar 90 19:51:23 GMT References: <3078@soleil.oakhill.UUCP> <18376@duke.cs.duke.edu> Organization: Erasmus Universiteit Rotterdam, dept. CS (Informatica) Lines: 16 halldors@paul.rutgers.edu (Magnus M Halldorsson) writes: >Better yet, think of the points in the plane: > (0,0), (1-epsilon,1), (-1,-1), (0,2) >These form an (almost) perfect square. The points of max distance are >(0,0) and (0,2), but there's no way you can fit them on an enclosing >circle. Please correct me if I'm wrong, but aren't (-1,-1) and (0,2) the points we're looking for? Reino -- Reino R. A. de Boer "We want to build the right product right, right?" Erasmus University Rotterdam ( Informatica ) e-mail: reino@cs.eur.nl