Sutherland-HodgmanPolygon Clipping Algorithm
Subproblem:
- clip a polygon (vertex list) against a single clip plane
- output the vertex list(s) for the resulting clipped polygon(s)
-
Clip against all four planes
- generalizes to 3D (6 planes)
- generalizes to any convex clip polygon/polyhedron