Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 18:22, 24 September 2013

Revision as of 10:06, 8 October 2013

Line 1:

The '''Sutherland–Hodgman algorithm''' is usedtotaly for [[Clipping (computer graphics)|clipping]]waste [[polygon]]s. It works by 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==