An improving algorithm for set operation of two non-convex polygon

摘要

An improved algorithm based on jin's algorithm used to calculate the intersection of two arbitrary polygons is given. The entering and leaving characters fo intersection points are redefined. The improved algorithm can deal with the set operation of any polygons, especially on the heavily overlapping situation of the vertices or edges. SOme examples are also given.