Path: utzoo!attcan!uunet!mcsun!cernvax!chx400!metz
From: metz@iam.unibe.ch (Igor Metz)
Newsgroups: comp.graphics
Subject: Re: Point in Polygon Problem
Message-ID: <1990Aug8.094621.23623@chx400.switch.ch>
Date: 8 Aug 90 09:46:21 GMT
References: <5990@milton.u.washington.edu>
Sender: news@chx400.switch.ch (USENET News System)
Distribution: comp.graphics
Organization: CS Dept., University of Berne, Switzerland
Lines: 16

In article <5990@milton.u.washington.edu> benson@blake.acs.washington.edu (Dan Benson) writes:
>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.

get THE book:
F.P. Preparata/ M.I. Shamos: Computational Geometry: An Introduction. 2nd ed.
New York: Springer, 1988. p. 41ff
--
Igor Metz
Institut fuer Informatik und angew. Mathematik, Universitaet Bern, Switzerland.
domainNet: metz@iam.unibe.ch               Phone: (0041) 31 65 49 90
ARPA:      metz%iam.unibe.ch@relay.cs.net  Fax:   (0041) 31 65 39 65