Revision as of 11:40, 8 October 2013 edit JohnBlackburne (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 30,799 edits m Reverted 2 edits by 61.16.193.162 (talk) to last revision by 180.188.226.68. (TW) ← Previous edit		Revision as of 11:50, 8 October 2013 edit undo JohnBlackburne (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 30,799 edits rm misplaced spam Next edit →
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 false edges.'''~~ ~~Implementation is not optimal but working, GPL v2 Ashuha Arseniy Moscow Technical University http://dumpz.org/551873/~~ ==See also==

Sutherland–Hodgman algorithm: Difference between revisions