Path: utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!ncar!gatech!udel!rochester!PT.CS.CMU.EDU!andrew.cmu.edu!mp1u+
From: mp1u+@andrew.cmu.edu (Michael Portuesi)
Newsgroups: comp.graphics
Subject: Algorithm wanted: Circle enclosing points
Message-ID: <wWIfSMy00Xo3A5u1dC@andrew.cmu.edu>
Date: 31 Mar 88 21:18:16 GMT
Organization: Carnegie Mellon University
Lines: 12

I am looking for an efficient algorithm that, given a set of points, finds the
smallest circle enclosing them and its center.  Pseudocode, actual code (C,
Pascal or Lisp preferable), or references to published material all would be
appreciated.

                --M


Michael Portuesi / Carnegie Mellon University
ARPA/UUCP: mp1u+@andrew.cmu.edu         BITNET: rainwalker@drycas

"Paradise is exactly like where you are right now...only much, much better"
        --Laurie Anderson, "Language is a Virus"