Path: utzoo!utgpu!watmath!watcgl!ksbooth
From: ksbooth@watcgl.waterloo.edu (Kelly Booth)
Newsgroups: comp.graphics
Subject: Re: Intersection between a line and a polygon (UNDECIDABLE??)
Message-ID: <11731@watcgl.waterloo.edu>
Date: 2 Oct 89 01:30:52 GMT
References: <2972@ndsuvax.UUCP> <32610@cornell.UUCP> <14759@bloom-beacon.MIT.EDU>
Reply-To: ksbooth@watcgl.waterloo.edu (Kelly Booth)
Organization: U. of Waterloo, Ontario
Lines: 17

In article <14759@bloom-beacon.MIT.EDU> tuna@athena.mit.edu (Kirk 'UhOh' Johnson) writes:
>
>look in any respectable introductory graphics book (foley and van dam,
>newman and sproull, etc.) and you'll see that this is a solved (many
>times over) problem.
>
>it is definitely _FAR_ from undecidable; it's actually fairly simple
>to solve.
>
>if after you've found such a book and read what it has to say you find
>yourself still completely confused, then try asking the net for
>guidance.
>
>kirk

I think this is what the original posting was trying to say.  But
apparently his :) key was broken when he posted.