Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!samsung!uakari.primate.wisc.edu!dali.cs.montana.edu!milton!blake.acs.washington.edu!benson
From: benson@blake.acs.washington.edu (Dan Benson)
Newsgroups: comp.graphics
Subject: Point in Polygon Problem
Message-ID: <5990@milton.u.washington.edu>
Date: 7 Aug 90 18:42:51 GMT
Sender: news@milton.u.washington.edu
Distribution: comp.graphics
Organization: University of Washington, Seattle
Lines: 15

I know this has been asked before but I missed the answers.  I want to
know the best way to determine whether a point is inside of a polygon
where the polygon is represented as a set of ordered floating point
numbers (its boundary).  I'm actually using 3D points but the polygons
are defined on 2D planes.  Also, the polygons can be any shape, concave,
convex.

If anyone has some suggestions or real answers I would appreciate it.
And if there is more interest I will post a summary.
Thanks in advance,
--
| Dan Benson                        benson@ee.washington.edu    |
| Dept. of Elec. Engr., FT-10                                   |
| University of Washington          (206) 685-7567              |
| Seattle, WA  98195                                            |