【摘要】 为简化已有任意简单多边形求交算法并提高算法效率,首先将交点分类并排序,然后采用不同的遍历方法得到多边形的交集、并集和差集,在该算法的基础上设计带孔洞多边形的求交算法.所有算法均被实现,且复杂度较低,鲁棒性较好.更多还原

【Abstract】 To simplify the algorithms on intersection of polygons with holes and improve the efficiency,a new algorithm is proposed.In the algorithm,the intersected points are firstly classified and sorted,and the intersection sets,union sets and subtraction sets of the polygons are obtained by using different tra-verse methods.Based on the algorithm,the algorithm on intersection of polygons with holes is designed.All the algorithms are implemented.The result indicates that the intersection algorithm has lower complexity and better robustness.更多还原