交叉多边形 crossing polygon ; CPolygon
交叉多边形多边形框选 crossing polygon
正交凸线多边形 orthogonally convex rectilinear polygon
该算法不仅可以求多边形的“交”，而且可以求多边形的“并”和“差”。
This algorithm can be used to calculate not only intersection but also set-theoretic differences and union of two polygons .
作者在对已有的多边形填充算法深入研究的基础上，给出了一种称之为“完全记忆求交法”的新的多边形填充算法。新算法较已有算法有更高的效率。
Base on the research for the algorithm, which have had, of filling up polygon, Authors give a new algorithm, to be known as "the algorithm to calculate points of intersection with completely memory".
应用推荐