The Weiler-Atherton algorithm implemented here works for clipping of one concave polygon against another and handles all special cases (i.e. coincident edges, coincident vertices, vertex of one polygon lying on the edge of the other, etc.). The implementation however, does not take care of self-intersecting polygons and polygons with holes.