An Algorithm for Computing the Union, Intersection and Difference of Two Polygons

An new idea for setting operations on pairs of polygons algorithm is presented. The algorithm uses a boundary representation for the input and output polygons. Its domain includes polygons as well as polygons with holes within the area of the polygon. The algorithm runs in time O((n+m+k) ) in a worst presented case, where n and m are the vertex number of the two polygons respectively, and k is the number of point of intersection. The algorithm well resolves the issues in special cases, such as overlapped edges, edges intersection at the vertex of edges, etc. It is facilitated by the use of double circular linked list. The algorithm is easy to implement.