Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!gatech!udel!klaiber
From: klaiber@udel.UUCP
Newsgroups: comp.graphics
Subject: Re: Point inside of polygon revisited... A NEW APPROACH
Message-ID: <290@louie.udel.EDU>
Date: Fri, 19-Jun-87 18:42:09 EDT
Article-I.D.: louie.290
Posted: Fri Jun 19 18:42:09 1987
Date-Received: Sat, 20-Jun-87 09:57:00 EDT
References: <948@elrond.CalComp.COM> <790@thumper.UUCP> <284@louie.udel.EDU> <538@hplabsz.HPL.HP.COM>
Sender: usenet@udel.EDU
Reply-To: klaiber@udel.EDU (Alexander Klaiber)
Organization: University of Delaware
Lines: 19
Keywords: ray tracing, graphics, polygon intersection

In article <538@hplabsz.HPL.HP.COM> dleigh@hplabsz.HPL.HP.COM (Darren Leigh) writes:
>[...] I guess you mean
>convex polygons, not concave.  This algorithm won't work for concave
>polygons because one part of the polygon might be on one side of a
>particular bounding plane while another part would be on the other side.

ooooops! Yup, I goofed on that one. Of course I meant to say "convex", but
it must have been late or maybe I had other things on my mind...
Alright everybody: "convex" is it -- or, to put it explicitly, polygons
with the property:
	for every two points P1,P2 inside the polygon, the line P1-P2 is
	also entirely inside the polygon.
(always had trouble with convex vs. concave in highschool.....)

Thanks for pointing out,


      Alexander Klaiber
      klaiber@dewey.udel.edu