Message-ID:	<3314CFCC.54B7@pobox.oleane.com>
Date:	Thu, 27 Feb 1997 01:05:32 +0100
From:	Francois Charton <deef AT pobox DOT oleane DOT com>
Organization:	CCMSA
MIME-Version:	1.0
To:	djgpp AT delorie DOT com
CC:	Mark T Logan <fwec AT juno DOT com>
Subject:	Re: bounding circle vs. bounding boxes oops...
References:	<19970226 DOT 065019 DOT 4511 DOT 1 DOT fwec AT juno DOT com> <33146FD7 DOT A93 AT pobox DOT oleane DOT com>

Francois Charton wrote:
> 
> Mark T Logan wrote:
> >
> > I need to calculate the bounding box of a set of points.
> > That is, the smallest rectangle which will encompass
> > all the points.  I decided that I could simply find the greatest
> > x value among all the points, the greatest y value, and then
> > the least x and y values to find the edges of my box.  To
> > easy, I decided.
> >
> > How can I calculate a bounding circle?  Anyone know?
> >
> 
> The best (ie smallest) bounding circle can be calculated as follow :
> find the two points A and B in your set which are farthest from each
> other, the best circle has the middle of segment AB as its center, and
> half the distance between A and B as its radius.
> 

Sorry, this one is just plain wrong... 

The rest should be right though :-(

Francois

- Raw text -