Path: utzoo!utgpu!water!watmath!clyde!burl!codas!mtune!icus!gil From: gil@icus.UUCP (Gil Kloepfer Jr.) Newsgroups: comp.graphics Subject: Re: COMPLICATED PROBLEM (point inside poly AGAIN!) Summary: Interesting algs... Message-ID: <282@icus.UUCP> Date: 6 Mar 88 08:57:44 GMT References: <971@ut-emx.UUCP> <20533@amdcad.AMD.COM> <7626@pur-ee.UUCP> <3320@bloom-beacon.MIT.EDU> <590@naucse.UUCP> Reply-To: gil@icus.UUCP (Gil Kloepfer Jr.) Organization: ICUS Computer Group, Islip, NY Lines: 32 Keywords: READ THIS ONLY IF YOUR IQ >>125 In article <590@naucse.UUCP> rrr@naucse.UUCP writes: >Sounds interesting. Lets here about the algorithm, it does sound >rather specific though, like xor is not that common in (none bit mask) >graphic routines. > > -bob > >Robert R. Rose >Northern Arizona University, Box 15600 >Flagstaff, AZ 86011 > .....!ihnp4!arizona!naucse!rrr A book which may be of some interest is a book called "Collected Algorithims" by David Douglas. I believe the book comes out of the Harvard graphics/geographic systems lab somehow. I know I have seen the book .. and it contains some very interesting algs of this nature. Also interesting is a paperback book entitled _A_Programmer's_Geometry_ (I forgot the author) which has a wealth of information about geometric routines used often in computer graphics. +====================================+========================================+ | Gil Kloepfer, Jr. | Net-Address: | | Senior Programmer | {boulder,ihnp4,talcott}!icus!gil | | Bowne Management Systems, Inc. | Voice: Home: (516) 968-6860 | | 235 E. Jericho Turnpike | Office: (516) 248-6840 x796 | | Mineola, New York 11501 | Internet: gil@icus.UUCP | +====================================+========================================+ | Disclaimer: My employers know I'm right, but will never admit to it... | +=============================================================================+