Plane-at-a-Time Clipping

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 traingle is treated by on of the four cases mentioned previously.

It is straightforward to extend this algorithm to 3D.


(Click on the image below to see clipping againist multiple planes.)


Lecture 11   Slide 11   6.837 Fall '01