论文标题
提高了凸出凸多边形的判断算法
An improved judgement algorithm of point in-out convex polygons
论文作者
论文摘要
本文提出了一种方法来判断该点是通过垂直线的相交的简单凸多边形内部还是外部的。它确定了由两条直线包围的区域的点，然后将确定凸多边形内部还是外部确定点是确定点是否在四边形内部还是外部的问题。之后，使用射线方法来判断它。该算法的复杂性为O（1）对O（n）。正如实验结果所示，该算法的交叉点更少，并且大大提高了判断的效率。
This paper proposed a method to judge whether the point is inside or outside of the simple convex polygon by the intersection of the vertical line. It determined the point to an area enclosed by two straight lines, then convert the problem of determining whether a point is inside or outside of a convex polygon into the problem of determining whether a point is inside or outside of a quadrilateral. After that, use the ray method to judge it. The complexity of this algorithm is O(1) to O(n). As the experimental results show, the algorithm has fewer intersections and greatly improves the efficiency of the judgment.
