Xref: utzoo comp.graphics:1961 comp.sys.ibm.pc:13076
Path: utzoo!mnetor!uunet!husc6!hao!ames!elroy!cit-vax!tybalt.caltech.edu!gtchen
From: gtchen@tybalt.caltech.edu (George T. Chen)
Newsgroups: comp.graphics,comp.sys.ibm.pc
Subject: Re: COMPLICATED PROBLEM; ONLY INTELLIGENT PEOPLE SHOULD READ
Message-ID: <5740@cit-vax.Caltech.Edu>
Date: 12 Mar 88 01:32:27 GMT
Sender: news@cit-vax.Caltech.Edu
Reply-To: gtchen@tybalt.caltech.edu.UUCP (George T. Chen)
Organization: California Institute of Technology
Lines: 15

Does any of the previously mentioned algorithm work with overlapping
polygons?  For example, consider the grid

	1	2	3

	4	5	6

	7	8	9

Consider the polygon defined by: 1-2-6-9-7-4-2-3-5-1
Most algorithms (including the odd-even boundary method) will consider
the diamond region between 2 and 5 to be outside the polygon although
it's suppose to be inside.

Comments?