Path: utzoo!mnetor!uunet!husc6!cmcl2!nrl-cmf!ames!pasteur!ucbvax!ucsfcgl!pixar!flip From: flip@pixar.UUCP (Flip Phillips) Newsgroups: comp.graphics Subject: Re: Algorithm wanted: Circle enclosing points Message-ID: <1697@pixar.UUCP> Date: 4 Apr 88 19:35:45 GMT References: <1695@pixar.UUCP> Reply-To: flip@pixar.UUCP (Flip Phillips) Organization: Pixar -- Marin County, California Lines: 22 In article <1695@pixar.UUCP> flip@pixar.UUCP (Flip Phillips) writes: [...] >this willget tham all for sure, if you want the smallest, circle you >could just chose the radius as the distance to the point farthest away. > >mind you this is just off the top of my head, probably full of holes but an >idea none the less. ahh yes, off the top of my head... This isn't the SMALLEST circle, as was pointed out by a mail reply I got [ i forgot from who, apologies, apologies ]. so like, find the convex hull, youve got the small set of points needed to find a triangle which describes that circle... cheers -- flip -- Flip Phillips {sun | ucbvax}!pixar!flip Pixar - Marin County, California