Stable serial optimal and parallel algorithm of point-in-polygon test
点对多边形位置检测的稳定串行最优与并行的算法

Point-in-polygon test is a bottom and basic problem of computer graphics. The current algorithm is more, but these algorithms are complex or unstable and all more or less exists some problems. For improving the algorithm, the text started with analyzing the plus or minus characteristic of a straight line, further described roundly various mutual positions relation between the point and the directed line segment and the corresponding disposing process. By means of the plus or minus characteristic, not only simplified the position judgment between the point and the directed line segment, reduced the algorithm complexity, more eliminated drastically various unstable factors. It realized the serial and parallel algorithm. Finally experimental results prove that the serial algorithm is a stable optimal algorithm.