Lecture05-Clipping 计算机图形学ppt课件.ppt

Cohen-Sutherland Line Clipping Algorithm: if (code0 == code1 == 0000) accept the line if ((code0 code1 ) != 0) reject the line Clip the line against an edge (where both bits are nonzero) Assign the new vertex a 4-bit value Return to 1 Recursive Subdivision Clipping Recursive Subdivision Clipping Recursive Subdivision Level 1 Recursive Subdivision Level 2 Recursive Subdivision Level 3 Recursive Subdivision Level 3 Recursive Subdivision Level 3 Recursive Subdivision Level 3 Recursive Subdivision Level 3 Recursive Subdivision Clipping Accurate to 3 Binary Digits Liang-Barsky Line Clipping Consider the parametric definition of a line: x = x1 + u?x y = y1 + u?y ?x = (x2 - x1), ?y = (y2 - y1), 0 ≤ (u, v) ≤ 1 What if we could find the range for u and v in which both x and y are inside the viewport? Liang-Barsky Line Clipping Mathematically, this means xmin ≤ x1 + u?x ≤ xmax ymin ≤ y1 + u?y ≤ ymax Rearranging, we get -u?x ≤ (x1 - xmin) u?x ≤ (xmax - x1) -v?y ≤ (y1 - ymin) v?y ≤ (ymax - y1) In general: u * pk ≤ qk Liang-Barsky Line Clipping Cases: pk = 0 Line is parallel to boundaries If for the same k, qk 0, reject Else, accept pk 0 Line starts outside this boundary rk = qk / pk u1 = max(0, rk, u1) Cases: (cont’d) 3. pk 0 Line starts outside this boundary rk = qk / pk u2 = min(1, rk, u2) 4. If u1 u2, the line is completely outside Liang-Barsky Line Clipping Also extends to 3D Just add equations for z = z1 + u?z 2 more p’s and q’s Liang-Barsky Line Clipping In most cases, Liang-Barsky is slightly more efficient According to the Hearn-Baker textbook Avoids multiple shortenings of line segments However, Cohen-Sutherland is much easier to understand (I think) An important issue if you’re actually implementing Weiler-Atherton Polygon Clipping When using Sutherland-Hodgeman, concavities can end up linked A different clipping algorithm, the Weiler-Atherton algorithm, creates separate polygons Weiler-Atherton Clipping Gives “Right” Answer Weiler