第三章02--计算机图形学.pptVIP

Cohen-Sutherland Subdivision Line Clipping Algorithm CH3-2 Introduce A clipping algorithm developed by Dan Cohen and Ivan Sutherland uses the end point codes to trivially accept or reject a line segment. If the line segment cannot be trivially accepted or rejected, then the cohen-Sutherland algorithm divides the line at a window edge. The algorithm does not check to see if the intersection point is within the window, but rather attempts to accept or reject the two resulting segments using the line end point codes for the segments. Recalling line P1P2 of Fig.3-3 immediately reveals a difficulty with this simple technique. If P1P2 is clipped against the left edge of the window, the two new segments are P1P1’ and P1’P2. The end point codes for both these segments indicate that they both may be partially visible. ?_?_? Hence, neither can be rejected as invisible or accepted as visible. The key to the Cohen-Sutherland algorithm is always knowing that one of the end points is outside the window. Thus, the segment from this end point to the intersection point can always be rejected as invisible. The algorithm then proceeds with the remainder of the line. In effect this replaces the original end point with the intersection point. Cohen-Sutherland algorithm For each window edge: For the line P1P2, determine if the line is totally visible or can be trivially rejected as invisible. If P1 is outside the window, continue; otherwise, swap P1 and P2. Replace P1 with the intersection of P1P2 and the window edge. Page 182 Example 3-3 Co-Su 2-D clipping algorithm Page 183 The end P10 P6 P9 0001 0101 0100 0110 0010 0000 1010 1000 1001 P4 P3 Bit 4 Bit 3 Bit 2 Bit 1 P’5 P’7 P’8 P10 P6 P9 0001 0101 0100 0110 0010 0000 1010 1000 1001 P4 P3 Bit 4 Bit 3 Bit 2 Bit 1 P’5 P’7 P’8 P10 P6 P9 0001 0101 0100 0110 0010 0000 1010 1000 1001 P4 P3 Bit 4 Bit 3 Bit 2 Bit 1 P’5 P’7 P’8 P10 P6 0001 0101 0100 0110 0010 0000 1010 1000 1001 P4 P3 Bit 4 Bit 3 Bit 2 Bit 1 P’5 P’7 P’8 P’9 P10 P6 0001 0