Computer Graphics - 12
9. Suppose edge AB is an edge of the pruning window, P 0 P 1 . P N-1 is the list of vertices of the polygon to be pruned (convex convex polygon). According to Hogmans algorithm, P i-1 and P i are both on the right side of edge AB, then the vertex included in the list of polygons after pruning ...





