Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!bloom-beacon!apple!versatc!ritter
From: ritter@versatc.UUCP (Jack Ritter)
Newsgroups: comp.graphics
Subject: Ray Traced Bounding Spheres
Keywords: Ray trace, bounding volumes, intersection
Message-ID: <17241@versatc.UUCP>
Date: 10 May 89 20:46:30 GMT
Organization: Versatec, Santa Clara, Ca. 95051
Lines: 16

Given a cluster of points in 3 space, is there
a good method for finding the minumum radius
sphere which encloses all the points?  If not
minumum, at least "small"?  Certainly it should
be tighter than the sphere which encloses the
minimum bounding box.

I have a feeling the solution is iterative. If
so, I could provide a good initial guess for the
center & radius.

-- 
	      ->  S C R E W    E X X O N    <-
   Jack Ritter, S/W Eng. Versatec, 2710 Walsh Av, Santa Clara, CA 95051
   Mail Stop 1-7.  (408)982-4332, or (408)988-2800 X 5743
   UUCP: {pyramid,mips,vsi1,arisia}!versatc!ritter