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.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Sutherland-Hodgman algorithm (Wikipedia)
Invented By
Ivan Sutherland co-developed this polygon-clipping algorithm with Gary Hodgman, published in 1974.
Source Wikipedia: Ivan Sutherland
Sources
1. Sutherland-Hodgman Algorithm (Wikipedia)
Wikipedia infobox: time complexity linearQuote, Wikipedia infobox: time complexity linear
linear
Sutherland-Hodgman algorithm (Wikipedia)
In Field: Computer Graphics, Lead sentence
Sutherland-Hodgman algorithm is an algorithm used for clipping polygons.
In Group: Line Drawing and Clipping Algorithms, Lead section
algorithm used for clipping polygons
View the SourceReader 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.