Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ncar!husc6!yale!spolsky-joel From: spolsky-joel@CS.Yale.EDU (Joel Spolsky) Newsgroups: comp.graphics Subject: looking for way to find all points inside polygon Message-ID: <54965@yale-celray.yale.UUCP> Date: 28 Mar 89 01:58:04 GMT Sender: root@yale.UUCP Reply-To: spolsky-joel@CS.Yale.EDU (Joel Spolsky) Organization: Yale University Computer Science Dept, New Haven CT 06520-2158 Lines: 15 Hello all, I am looking for a fast algorithm to find all the points inside an arbitrary polygon. Does anyone have any code (in any reasonable language) to do this reliably and quickly? Many thanks, Joel +----------------+----------------------------------------------------------+ | Joel Spolsky | bitnet: spolsky@yalecs.bitnet uucp: ...!yale!spolsky | | | internet: spolsky@cs.yale.edu voicenet: 203-436-1483 | +----------------+----------------------------------------------------------+ #include