Re: Smallest circle around n points in space.

Article View: comp.theory

Article #2130

#2130

From: Mark B. Novick
Date: Wed, 14 Mar 1990 21:15

7 lines
981 bytes

If you are concerned with the 2-d case, take a look at Preparata and
Shamos' book Computational Geometry.  They call the problem the
smallest enclosing circle problem, and give efficient algorithms to
solve it.  Some of them are based on Voronoi diagram techniques.
The asymptotically fastest algorithm they give runs in theta(n) time,
where n is the number of points.

Technical Details

Message-ID: <38647@cornell.UUCP>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!batcomputer!cornell!novick

References: <3078@soleil.oakhill.UUCP>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!batcomputer!cornell!novick
From: novick@svax.cs.cornell.edu (Mark B. Novick)
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: <38647@cornell.UUCP>
Date: 14 Mar 90 21:15:28 GMT
References: <3078@soleil.oakhill.UUCP>
Sender: nobody@cornell.UUCP
Reply-To: novick@svax.cs.cornell.edu (Mark B. Novick)
Organization: Cornell Univ. CS Dept, Ithaca NY
Lines: 7

Reply to Parent Message