Revision as of 10:06, 8 October 2013 edit 61.16.193.162 (talk) No edit summary ← Previous edit		Revision as of 11:18, 8 October 2013 edit undo 61.16.193.162 (talk) No edit summary Next edit →
Line 1: The '''Sutherland–Hodgman algorithm''' is totaly waste [[polygon]]s. It ~~works~~cannot bybe extending each line of the [[convex polygon\|convex]] ''clip polygon'' in turn and selecting only vertices from the ''subject polygon'' those are on the visible side. ==Description==

Sutherland–Hodgman algorithm: Difference between revisions