The results of Sutherland-Hodgeman clipping can get
complicated very quickly once multiple clip-planes are considered.
However, the algorithm is still very simple.
Each clip plane is treated independently, and each
triangle is treated by one of the four cases
mentioned previously.
It is straightforward to extend this algorithm to 3D.
|
(Click on the image below to see clipping against multiple planes.)
|
