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 ★
Comum · Saberes
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.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
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.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Algoritmo de Bellman-Ford
Nº Q816022 ★★
Sem ofertas
-
Floyd–Steinberg dithering
Image dithering algorithm
Nº Q1324107 ★
Sem ofertas
-
Shunting yard algorithm
Stack-based algorithm for parsing infix mathematical expression
Nº Q1199602 ★★
Sem ofertas
-
Petrie polygon
Skew polygon derived from a polytope
Nº Q3395593 ★
Sem ofertas
-
Algoritmo do pintor
Nº Q936719 ★
Sem ofertas
-
A
Algoritmo de Chudnovsky
Algoritmo utilizado para cálculos de alta precisão de algarismos de π
Nº Q2208385 ★★
Sem ofertas