Method of Point Inclusion Test for Simple Polygons Based on Forked Point
Shuqiang Chen · Jisuanji gongcheng · 2007
This paper puts forward a new method for detecting whether a point is within a polygon.The method is composed of two sections. namely,pretreatment for the obtainment of all forked points of the polygon P and detection for finding out related points and edges by using binary search,according to the parity of the number of the related edge which detection line passes through to test wheter a point is within tge polygon.The method can deal with abnormal conditions which ray-crossing algorithm can not and need not handle all edges of polygon in the detection process. Experimental results show that the method is robust and efficient in computation.