Arbitrary Polygon Clipping with Overlapping Edges Removal
An extension to the Sutherland-Hodgman Algorithm for the polygon clipping with the overlapping edges removal is presented. A temporary vertex list and an intersection vertex list are set up when each edge of the polygon is clipped along the clipping window lines. A vertex tracing is performed thereafter to produce sub-polygons as the clipped result. The definition of these sub-polygons are the same as the input one. They do not have overlapping edges with the reentrant characteristics preserved.