Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!cditi!josh
From: josh@cditi.UUCP (Josh Muskovitz)
Newsgroups: comp.graphics
Subject: Re: smallest sphere enclosing a set of points
Summary: not fair
Message-ID: <660@cditi.UUCP>
Date: 8 Dec 89 18:35:29 GMT
References: <28@<Nov- <207400043@s.cs.uiuc.edu> <658@cditi.UUCP> <679@dbrmelb.dbrhi.oz>
Organization: CDI Technologies Inc., Grand Rapids, MI
Lines: 18

In article <679@dbrmelb.dbrhi.oz>, davidp@dbrmelb.dbrhi.oz (David Paterson) writes:
> In article <4893@skinner.nprdc.arpa>, malloy@nprdc.arpa (Sean Malloy) writes:
> > Then generalize it. Find the largest distance between any two points.

text deleted

> Sorry, still doesn't work, consider, for instance the circle surrounding
> points (-1,0),(1,0),(0,2).
> -----------------------------------------------------------------------
> David Paterson, CSIRO, Highett, 3190, Victoria, Australia

It's not fair to dismiss this case using negative points.  To avoid this,
simply transform the points into the first octant, try again, and transform
the sphere back.  Or is that too simple?

Josh Muskovitz
Computer Design, Inc.
josh@uunet!cditi