Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!orion.oac.uci.edu!ucivax!ucla-cs!twinsun!rusmin
From: rusmin@twinsun.com (Rusmin Dirgantoro)
Newsgroups: comp.graphics
Subject: Re: Point in Polygon Problem
Message-ID: <1990Aug23.232703.18186@twinsun.com>
Date: 23 Aug 90 23:27:03 GMT
References: <1990Aug22.022743.4139@twinsun.com> <2018@idunno.Princeton.EDU> <1990Aug23.000651.10581@twinsun.com>
Sender: usenet@twinsun.com
Distribution: comp.graphics
Organization: Twin Sun, Inc
Lines: 34

In article <1990Aug23.000651.10581@twinsun.com> rusmin@twinsun.com (Rusmin Dirgantoro) writes:
>In article <2018@idunno.Princeton.EDU> markv@gauss.Princeton.EDU (Mark VandeWettering) writes:
>>In article <1990Aug22.022743.4139@twinsun.com> rusmin@twinsun.com (Rusmin Dirgantoro) writes:
>>>In article <5990@milton.u.washington.edu> benson@blake.acs.washington.edu (Dan Benson) writes:
>>>> [ ask for points in polygon algorithms ]
>>> [ responds with an "almost right" algorithm ] 
>But his solution has a little glitch.
>...
>Consider this polygon...
>
>               +--------------------------------+
>               |                                |
>               |                                |
>               |         D     E     F          |
>y=0  - - o - - o----o----o - - o - - o----o-----o - - o - -
>         A     B    C    |           |    G     H     I
>                         |           |
>                         |           |
>                         +-----------+

Ooops...
This is not right. I'm sorry about that.
After rethinking about it, I found that Mark's algorithm works in
this case as well. I was out of my head.
Just ignore my previous posting.

Thanks for your responses, though.

Bye.

--
Rusmin Dirgantoro                     rusmin@twinsun.com
Twin Sun Inc.                         1(213)640-6885 office
El Segundo, California                1(213)837-3941 home