Sutherland–Hodgman algorithm: Difference between revisions

Revision as of 08:17, 6 July 2010

Revision as of 05:31, 11 October 2010

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.

==''''''

==Description==

==de[[gnvjg

\

]] ==

''''''==

The algorithm begins with an input [[List (computing)|list]] of all vertices in the subject polygon. Next, one side of the clip polygon is extended infinitely in both directions, and the path of the subject polygon is traversed. Vertices from the input list are inserted into an output list if they lie on the visible side of the extended clip polygon line, and new vertices are added to the output list where the subject polygon path crosses the extended clip polygon line.