Xref: utzoo comp.theory:493 comp.sources.wanted:11072 sci.math:10373 sci.math.num-analysis:657
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!van-bc!ubc-cs!fornax!mahajan
From: mahajan@fornax.UUCP (Sanjeev Mahajan)
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: <450@fornax.UUCP>
Date: 22 Mar 90 00:06:11 GMT
References: <3078@soleil.oakhill.UUCP> <18376@duke.cs.duke.edu>
Organization: School of Computing Science, SFU, Burnaby, B.C. Canada
Lines: 10

In article <18376@duke.cs.duke.edu>, avr@romeo.cs.duke.edu (A. V. Ramesh) writes:
> In article <Mar.14.18.11.32.1990.2269@vanhalen.rutgers.edu>, bohannon@vanhalen.rutgers.edu (Philip Bohannon) writes:


There is an O(nlog n) algorithm for the problem, any standard computational
geometry reference should have this algorithm.



Sanjeev