Algorithmintro
Sutherland-Hodgman algorithm
Also called Sutherland-Hodgman clipping, Sutherland–Hodgman polygon clipping.
Clips a polygon against a convex window one half-plane at a time; the subject may be nonconvex, the clip must be convex.
Clips a polygon against a convex window one half-plane at a time; the subject may be nonconvex, the clip must be convex.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 2W87VM Edit this page History Report an error