Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!cernvax!unizh!meyer
From: meyer@unizh.UUCP (Urs Meyer)
Newsgroups: comp.graphics
Subject: Re: smallest sphere enclosing a set of
Message-ID: <313@unizh.UUCP>
Date: 7 Dec 89 12:59:24 GMT
Sender: <unizh!gorgo!meyer>
Reply-To: meyer@ifi.unizh.ch (Urs Meyer)
Organization: Inst. fuer Informatik, Univ. Zuerich, Switzerland
Lines: 16

Check out the following references:

D. Jack Elzinga and Donald W. Hearn: The Minimum Covering Sphere Problem,
	in Management Science, Vol 19(1), Sept 1972.

Jack Elzinga and Donald W. Hearn: Geometrical Solutions for Some
	Minimax Location Problems, in Transportation Science Vol 6, 1972.

Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R3 and
	Related Problems, in SIAM Journal of Computing, Vol 12(4), Nov 1983.

May be these refs should be included in Jef's weekly posting.

Urs Meyer
University of Zurich, Dept of Computer Science, Multi-Media Lab, CH-8057 Zurich
meyer@ifi.unizh.ch [ @relay.cs.net ], {uunet,...}!mcvax!cernvax!unizh!meyer