Path: utzoo!mnetor!uunet!mcvax!ukc!warwick!pssw
From: pssw@warwick.UUCP (P S Swanson)
Newsgroups: comp.graphics
Subject: polygon enclosing point
Message-ID: <615@ubu.warwick.UUCP>
Date: 18 Apr 88 12:43:40 GMT
Sender: news@warwick.UUCP
Reply-To: pssw@diamond.UUCP (P S Swanson)
Distribution: comp.graphics
Organization: Computer Science, Warwick University, UK
Lines: 10

I am writing an asteroids game, and need an algorithm to say whether a single
point is enclosed by, or lies on the perimeter of a closed polygon, defined by
an unspecified number of line segments.  Any offers ?

In addition, is there a very simple routine I have overlooked for finding
whether two line segments intersect.  Mine is not too bad, but I feel sure
there must be a blatantly obvious solution I have missed.


NUFC OK !