Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 23:13, 22 January 2015

Revision as of 06:25, 6 April 2015

Line 1:

The '''Sutherland–Hodgman algorithm''' is used for [[Clipping (computer graphics)|clipping]] [[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'' that are on the visible side. Namita Powar also helped in developing the algorithm.

==Description==