Re: smallest disk covering a set of points
From: Phil Holman (philjud_at_earthlink.not)
Date: 05/16/04
- Previous message: Edward G. Nilges: "Re: Offshore Outsourcing"
- In reply to: Carlos Moreno: "Re: smallest disk covering a set of points"
- Next in thread: Carlos Moreno: "Re: smallest disk covering a set of points"
- Reply: Carlos Moreno: "Re: smallest disk covering a set of points"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 16 May 2004 05:30:24 GMT
"Carlos Moreno" <moreno_at_mochima_dot_com@xx.xxx> wrote in message
news:Zuepc.73992$Qe.953790@wagner.videotron.net...
> Phil Holman wrote:
>
> > First iteration should be to pick a pair of points the greatest
> > distance apart and draw a circle where these points are
diametrically
> > opposite. If this is not the solution then the next iteration will
be
> > to consider the point furthest outside of the circle and draw a
circle
> > that goes through all three points. I haven't checked out to see if
> > this is the final solution but I can't see why it shouldn't be.
>
> It's not. I posted a counter-example to this algorithm in some other
> branch of this thread.
One more iteration. If there is a 4th point outside the second circle on
the opposite side of the circle from the 3rd point, then draw a circle
through points 3 and 4 and point 1 or 2 (whichever is furthest from
point 4). Try that.
Phil Holman
- Previous message: Edward G. Nilges: "Re: Offshore Outsourcing"
- In reply to: Carlos Moreno: "Re: smallest disk covering a set of points"
- Next in thread: Carlos Moreno: "Re: smallest disk covering a set of points"
- Reply: Carlos Moreno: "Re: smallest disk covering a set of points"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|