Path: utzoo!mnetor!uunet!wucs1!wucs2!posdamer
From: posdamer@wucs2.UUCP (Jeff Posdamer)
Newsgroups: comp.graphics
Subject: smallest contining circle
Message-ID: <825@wucs2.UUCP>
Date: 6 Apr 88 16:25:24 GMT
Organization: Washington University, St. Louis
Lines: 18
Keywords: computational geometry, circle, convex hull

Here we go again. PLEASE DON'T GUESS IF YOU DON'T KNOW!!!!

The solution has the following steps:

	A. Compute the convex hull of the point set 
	B. Compute maximum distance between points on convex hull polygon
	using   a hodograph algorithm
	C. Use maximum distance line segment as diameter of circle.

Each of these steps is described in Edelsbrunner or
Preparata and Shamos and the published literature. There are many algorithms for
each step, some of which are not obvious.

		Jeff Posdamer

-- 
Jeff Posdamer, Washington University, St. Louis, MO, (314) 889-6147
posdamer@syr.wustl.edu