Xref: utzoo comp.theory:501 comp.sources.wanted:11100 sci.math:10397 sci.math.num-analysis:671 Path: utzoo!utgpu!news-server.csri.toronto.edu!clyde.concordia.ca!mcgill-vision!bloom-beacon!eru!luth!sunic!mcsun!hp4nl!ruuinf!praxis!jagversm From: jagversm@praxis.cs.ruu.nl (Koen Versmissen) 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: <2711@ruuinf.cs.ruu.nl> Date: 23 Mar 90 10:46:41 GMT References: <3078@soleil.oakhill.UUCP> <18376@duke.cs.duke.edu> <1990Mar22.195123.2849@cs.eur.nl> Sender: news@ruuinf.cs.ruu.nl Followup-To: comp.theory Lines: 20 In article <1990Mar22.195123.2849@cs.eur.nl> reino@cs.eur.nl (Reino de Boer) writes: >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? No. If the four points are to form an (almost) perfect square, the third one should clearly be (-1, 1) instead of (-1,-1), so we _are_ looking for (0,0) and (0,2). ------------------------------------------------------------------------------ Koen Versmissen Rijksuniversiteit Utrecht (jagversm@praxis.cs.ruu.nl) The Netherlands