Sutherland-Hodgman Polygon Clipping

1-The Sutherland-Hodgman polygon clipping algorithm clips polygons against convex clipping windows.

2-It does so by clipping the subject polygon against each clip edge producing intermediate subject polygons.

3-The Sutherland-Hodgman may produce connecting lines that were not in the original polygon. When the subject polygon is concave (not convex) these connecting lines may be undesirable artifacts.