The Sutherland-Hodgman algorithm is an algorithm used for clipping polygons. It works by extending each line of the convex clip polygon in turn and selecting only the vertices of the subject polygon that fall on the visible side of that line.
Connections
Invented By
Ivan Sutherland co-developed this polygon-clipping algorithm with Gary Hodgman, published in 1974.
Source Wikipedia: Ivan Sutherland
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.