Hi Alan, from the SVN message I see that you have succeeded. I am going to study the source code and I will extend/modify example x25 to include some more challenging polygons, like the ones we discussed.
Regards, Arjen On 2009-12-17 07:12, Alan W. Irwin wrote: > Hi Arjen: > > I have now decided on a much better approach. I plan to modify > pointinpolygon (and also rename it pointnotinpolygon). The new version > should return 0, 1, or 2 depending on whether the test point is definitely > inside, near, or definitely outside the polygon border. Then the end phase > logic boils down to 6 possible tests using pointnotinpolygon (for polygon 1 > being inside, on border, or outside polygon 2 and vice versa) with a > definite result (unless there is bad logic somewhere) of either no fill, > fill polygon 2 split, or fill polygon 1. > > I am now confident of this end phase logic, and I hope to implement and > thoroughly test it tomorrow (Thursday). > ------------------------------------------------------------------------------ This SF.Net email is sponsored by the Verizon Developer Community Take advantage of Verizon's best-in-class app development support A streamlined, 14 day to market process makes app distribution fast and easy Join now and get one step closer to millions of Verizon customers http://p.sf.net/sfu/verizon-dev2dev _______________________________________________ Plplot-devel mailing list Plplot-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/plplot-devel
