Presentation is loading. Please wait.

Presentation is loading. Please wait.

Introduction to Computer Graphics Chapter 6 – 2D Viewing Pt 2 1.

Similar presentations

Presentation on theme: "Introduction to Computer Graphics Chapter 6 – 2D Viewing Pt 2 1."— Presentation transcript:

1 Introduction to Computer Graphics Chapter 6 – 2D Viewing Pt 2 1

2 2 CLIPPING OPERATIONS  Procedures that identifies those portions of a picture that are either inside or outside a specified region of a space is referred to as clipping algorithm or clipping  The region against which an object is to clipped is called clip window. before after

3 3 Clipping Operation Note: different graphic elements may require different clipping techniques. Character, need to include all or completely omit depending on whether or not its center lies within the window.

4 4 Clipping Application of clipping include: Extracting part of defined scene for viewing. Identifying visible surfaces in three-dimensional views. Anti-aliasing line segments or object boundaries. Creating objects using solid-modeling procedures. Displaying a multiwindow environment. Drawing and painting operations that allow parts of picture to be selected for copying, moving, erasing, or duplication.

5 5 Clipping Clipping algorithm can be applied in both world coordinate and normalized device coordinates In world coordinate: only the contents of the window interior are mapped to device coordinates world coordinate clipping removes those primitives outside the window from further consideration. Eliminating the unnecessary processing to transform In normalized device coordinate: mapping is fully done from world to normalized device. clipping will reduce calculations by allowing concatenation of viewing and geometric transformation matrices.

6 6 Clipping Algorithms Algorithms have been developed for clipping for the following primitives types: 1. Point Clipping. 2. Line Clipping (straight-line segments) 3. Area Clipping (polygons) 4. Curve Clipping 5. Text Clipping.

7 7 Point Clipping Assuming clip window is standard rectangle position, point P-(x,y) will be save for display if its satisfied: xw min <= x <= xw max yw min <= y <= yw max where the edges of the clip window (xw min, xw max, yw min, yw max ) can be either the world coordinate window boundaries or viewport boundaries.

8 8 Line Clipping Cohen-Sutherland Outcode Algorithm This algorithm quickly removes lines which entirely to one side of the clipping where both endpoints above, below, right or left. The advantage of the algorithm is, it uses bit operations for testing.

9 9 Cohen Sutherland 0000 10001010 0010 0110 01000101 0001 1001 A B C D E G F I K L M J S T H

10 10 Cohen Sutherland Bit convention 1 First bity > ymax Second bity < ymin Third bitx > xmax Fourth bitx < xmin Bit convention 2 (1 through 4 from right to left) bit 1 : left bit 2 : right bit 3 : below bit 4 : above

11 11 Cohen Sutherland Segment endpoints are each given 4-bit binary codes. The high order bit is set to 1 if the point above window The next bit set to 1 if point is below window The third and fourth indicate right or left of window. Testing result: 0000 if both endpoints are inside window. if the line segment lies entirely on one side of the window, then both endpoints will have a 1 in the outcode bit position for that side. How?: By taking AND operation. If NONZERO then line segment may be rejected. Ex: AB and CD

12 12 Cohen Sutherland (Problem?) Certain lines cannot be identified as completely inside or outside a clip window by doing AND test. Lines which completely outside the clip window can also produce AND 0000. So, process of discarding is required and intersection with boundary must be calculated (divide and conquer). Difficulty is when a line crossed one or more of the lines which contain the clipping boundary. Ex: EF and DJ

13 13 Cohen Sutherland (Solution) The point of intersection between the line segment and clipping lines may be used to break up the line segment. Intersection points with a clipping boundary can be calculated using the slope-intercept form of the line equation.

14 14 Cohen Sutherland (Solution) For a line with endpoint (x 1,y 1 ) to (x 2,y 2 ) Y coordinate of the intersection point with vertical boundary is obtained with y = y 1 + m(x-x 1 ) where x value is set either xw min or xw max and the slope of the line is m = ( y 2 – y 1 ) / ( x 2 – x 1 ) X coordinate of the intersection point with horizontal boundary is calculated by x = x 1 + (y-y 1 )/m where y is set either to yw min or to yw max

15 15 Cohen Sutherland (Pseudocode) Brief outline of the algorithm. First compute the outcodes for the two endpoints (p1 and p2). Enter the loop, check whether both outcodes are zero Both zero, then enter segment in display list. If not both zero, perform the AND function. If nonzero, reject the line. If zero, subdivide the line segment. Repeat the loop.

16 16 Liang Barsky Line Clipping Parametric equation of a line segment (x 1,y 1 ) and (x 2,y 2 ) x = x 1 + u∆x y = y 1 + u∆y Where 0 <= u <=1 ∆x = x 2 – x 1 ∆y = y 2 –y 1 From point clipping, we have xw min < = x <= xw max Yw min <= y <= yw max For line clipping, we derived xw min < = x1 + u∆x <= xw max yw min <= y1 + u∆y <= yw max

17 17 Liang-Barsky Line Clipping Based on these four equations, the following rules are introduced up k <= q k where k = 1 (left boundary) 2 (right boundary) 3 (bottom boundary) 4 (top boundary) parameters p and q are defined as: p 1 = -∆x,q 1 = x 1 - xw min p 2 = ∆x,q 2 = xw max – x 1 p 3 = - ∆y,q 3 = y 1 - yw min p 4 =∆y,q 4 = yw max – y 1

18 18 Liang-Barsky Line Clipping If any line that is parallel to one of the clipping boundaries, p k = 0. If q k < 0 then line is completely outside the boundary. When p k < 0, the infinite extension of the line proceeds from the outside to the inside. If p k > 0, the line proceeds from the inside to the outside. For nonzero value of p k, we can calculate the value of u corresponds to the point where infinitely extended line intersects the extension boundary k as u = q k / p k u 1 (outside to inside) where its value ranges from 0 to r u 2 (inside to outside) where its value ranges from 1 to r. If u 1 > u 2, the line is completely outside the clip window and can be rejected

19 19 L.B vs C.S Liang-Barsky algorithm is more efficient than Cohen since intersection calculations are reduced. Liang-Barsky require only one division and window intersections of the line are computed only once. Cohen required repeated calculation even though the line may be completely outside the clip window.

Download ppt "Introduction to Computer Graphics Chapter 6 – 2D Viewing Pt 2 1."

Similar presentations

Ads by Google