Path: utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!hao!noao!arizona!naucse!rrr
From: rrr@naucse.UUCP (Bob Rose )
Newsgroups: comp.graphics
Subject: Re: COMPLICATED PROBLEM (point inside poly AGAIN!)
Message-ID: <590@naucse.UUCP>
Date: 1 Mar 88 18:40:53 GMT
References: <971@ut-emx.UUCP> <20533@amdcad.AMD.COM> <7626@pur-ee.UUCP> <3320@bloom-beacon.MIT.EDU>
Organization: Northern Arizona University, Flagstaff, AZ
Lines: 17
Keywords: READ THIS ONLY IF YOUR IQ >>125
Summary: lets see it

In article <3320@bloom-beacon.MIT.EDU>, tada@athena.mit.edu (Michael Zehr) writes:
>> [Someones algo for finding if a point is inside a poly]
> The method I use in some graphics programs requires a compare and an
> xor for each edge of the polygon, and 2 multiplies (total, not for each
> edge).
> michael j zehr


Sounds interesting. Lets here about the algorithm, it does sound
rather specific though, like xor is not that common in (none bit mask)
graphic routines.

                                  -bob

Robert R. Rose
Northern Arizona University, Box 15600
Flagstaff, AZ 86011
                    .....!ihnp4!arizona!naucse!rrr