Content deleted Content added
m WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR, removed stub tag using AWB (9100) |
ɝ |
||
Line 35:
''ComputeIntersection'' is a trivial function, omitted here for clarity, which returns the intersection of a line segment and an infinite edge. Note that it is only called if such an intersection is known to exist, and hence can simply treat both lines as being infinitely long.
'''Implementation Sutherland-Hodgman algorithm to remove spurious edges.'''
Implementation is not optimal but working, GPL v2 Ashuha Arseny Moscow Technical University
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.
http://dumpz.org/551873/
==See also==
| |||