如果该点位于多边形内，该线将与多边形的边相交奇数次。
If the point is within the polygon, the line will intersect the edges of the polygon an odd number of times.
在传统多边形内点自动生成算法的基础上，提出了一种基于多边形三角化理论的内点自动生成算法。
On the base of analyzing the traditional methods of making polygon node, this paper puts forward a new method to automatically create node based on Triangulation Theory.
设 P和 Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
应用推荐