Mail Archives: djgpp/1997/02/26/19:08:13
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 -