计算庞大数量多边形的交叉点是非常花时间的。
Computing the intersections of a large number of polygons can be very time consuming.
说明：根据输入点组成线和面，并计算组成的凸多边形的质心、面积、是否和指定线交叉等。
The input lines of dots and the surface, and calculate the composition of the convex polygon centroid, area, and whether the specified line cross, etc.
例如，首先可能要测试物体碰撞盒子，看是否需要基于测试的多边形，或者碰撞盒子交叉点可能经常成为提供满意结果的唯一来源。
For example, object bounding boxes may first be tested to see if polygon based testing is necessary - or bounding box intersection may often be all that is needed to provide acceptable results.
针对平面点集最小权三角划分问题的特点，提出了新的交叉算子和变异算子，即多边形交叉算子与三角形变异算子。
Based on the characteristic of MWT problem, new operators for crossover and mutation are presented, that is, polygon crossover and triangular mutation.
可能会有多个交点—距离观察者最近的交叉点(一个可视多边形的)是将可见的。
There may be multiple points of intersection - the closest intersection (with a visible poly) to the viewer is the one that will be visible.
可能会有多个交点—距离观察者最近的交叉点(一个可视多边形的)是将可见的。
There may be multiple points of intersection - the closest intersection (with a visible poly) to the viewer is the one that will be visible.
应用推荐