The Sutherland-Hodgeman triangle clipping algorithm uses a divide-and-conquer strategy.
It first solves the simple problem of clipping a triangle against a single plane.
There are four possible relationships that a triangle can have relative to a clipping plane
as shown in the figures on the right.
Each of the clipping planes are applied in succession to every triangle.
There is minimal storage requirements for this algorithm, and it is well suited to
pipelining. As a result it is often used in hardware implementations.
|
(Click on the image below to see the various clipping cases for a single plane.)
|
