'''Implementation Sutherland-Hodgman algorithm to remove false edges.'''
Implementation is not optimal but working, GPL v2 Ashuha Arseny Moscow Technical University http://dumpz.org/551873/
The <sub>basic idea is to split the points into equivalence classes, such that the points are combined into one class if owned edge blade. Following points sorted by the distance from one point of clipper and join point within a class 0-1 2-3 and so on. After connecting all the other points but do not belong to the same class at the same time.
