Sutherland–Hodgman algorithm
Algorithm used for clipping polygons
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 vertices from the subject polygon that are on the visible side.
Nº Q1808181 ★
Common · Knowledge
Sutherland–Hodgman algorithm
Algorithm used for clipping polygons
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 vertices from the subject polygon that are on the visible side.
From Wikipedia
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 vertices from the subject polygon that are on the visible side.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Bellman–Ford algorithm
Algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
Nº Q816022 ★★
Not listed
-
Floyd–Steinberg dithering
Image dithering algorithm
Nº Q1324107 ★
Not listed
-
Shunting yard algorithm
Stack-based algorithm for parsing infix mathematical expression
Nº Q1199602 ★★
Not listed
-
Petrie polygon
Skew polygon derived from a polytope
Nº Q3395593 ★
Not listed
-
Painter's algorithm
Graphics algorithm in which polygons in a scene are sorted by depth and painted in this order, farthest to closest
Nº Q936719 ★
Not listed
-
C
Chudnovsky algorithm
Fast method for calculating the digits of π
Nº Q2208385 ★★
Not listed