Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!helios!gordon
From: gordon@cs.tamu.edu (Dan Gordon)
Newsgroups: comp.graphics
Subject: Re: Algorithm needed to determine if a point is inside a polygon
Keywords: polygon
Message-ID: <6952@helios.TAMU.EDU>
Date: 29 Jul 90 20:13:19 GMT
References: <1990Jul27.201939.17816@cbnewsh.att.com] <46093@brunix.UUCP> <6951@helios.TAMU.EDU>
Sender: usenet@helios.TAMU.EDU
Distribution: na
Organization: Computer Science Department, Texas A&M University
Lines: 2

I forgot to mention in my previous post that the logarithmic-time solution
works only for convex polygons.