Point in polygon testing based on normal direction
Xiao Ben-lin
Abstract
Xiao Ben-lin
Abstract
An algorithm of point in polygon testing based on normal direction is presented.A ray having several crossing points with the edges of polygon is drawn through a fixed point,two vectors are given from undetermined point to the endpoints of edge,then their normal directions is calculated.By using the normal direction as a reference for point in polygon test,the sum of normal directions of points and those edges is calculated.If the numbers of positive normals and negative normals are the same,the point is outside the polygon,otherwise,the point is inside the polygon.In the testing,the presented method can decrease computing time and can aviod some mistakes of other algorithm,its complexity is o(n).Experimental result show this algorithm is suitable for some other cases including self-intersection polygon.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An algorithm of point in polygon testing based on normal direction is presented.A ray having several crossing points with the edges of polygon is drawn through a fixed point,two vectors are given from undetermined point to the endpoints of edge,then their normal directions is calculated.By using the normal direction as a reference for point in polygon test,the sum of normal directions of points and those edges is calculated.If the numbers of positive normals and negative normals are the same,the point is outside the polygon,otherwise,the point is inside the polygon.In the testing,the presented method can decrease computing time and can aviod some mistakes of other algorithm,its complexity is o(n).Experimental result show this algorithm is suitable for some other cases including self-intersection polygon.
Key concepts: Polygon (computer graphics), Point in polygon, Point (geometry), Polygon covering, Intersection (aeronautics), Mathematics, Rectilinear polygon, Normal