两个复杂多边形求交的矢量算法

A Vector Algorithm for Computing the Intersection Set of Two Complex Polygons

基于计算几何和集合的基本理论 ,提出了任意两多边形求交的一种矢量算法 .该算法并非时间和复杂度最优 ,但总体较优 。

Based on computational geometry and set theory,a vector algorithm for getting the Intersection set of two complex polygons is put forward in this paper. This algorithm is not the best one on time-consumption and complexity, but generally it's a good algorithm. It may be widely used on the condition of computating polygons' intersection set.