1 / 70

Computer Graphics

Computer Graphics. Viewing. Viewing in 2D. 250 . 45 . Window in world coordinates. 250 x 250 Pixels. Viewport in Device coords. Viewing in 2D. In 2D, a ‘world’ consists of an infinite plane, defined in ‘world’ coordinates, i.e metres, angstroms etc.

ernestj
Download Presentation

Computer Graphics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Computer Graphics Viewing

  2. Viewing in 2D 250 45 Window in world coordinates. 250 x 250 Pixels. Viewport in Device coords

  3. Viewing in 2D • In 2D, a ‘world’ consists of an infinite plane, defined in ‘world’ coordinates, i.e metres, angstroms etc. • We need to pick an area of the 2D plane to view, referred to as the ‘window’. • On our display device, need to allocate an area for display, referred to as the ‘viewport’ in device specific coordinates. • Clip objects outside of window. • Translate to fit viewport. • Scale to device coordinates.

  4. Clipping Primitives • Different primitives can be handled in different ways • Points • Lines • Polygons

  5. Windowing I A scene is made up of a collection of objects specified in world coordinates World Coordinates

  6. Windowing II When we display a scene only those objects within a particular window are displayed Window wymax wymin wxmax wxmin World Coordinates

  7. Windowing III Because drawing things to a display takes time we clip everything outside the window Window wymax wymin wxmax wxmin World Coordinates

  8. Clipping For the image below consider which lines and points should be kept and which ones should be clipped P4 Window P2 wymax P6 P3 P1 P5 P7 P9 P8 wymin P10 wxmin wxmax

  9. Trivial acceptance. All line vertices lie inside box  accept.

  10. Point Clipping Easy - a point (x,y) is not clipped if: wxmin ≤ x ≤ wxmax AND wymin ≤ y ≤ wymax otherwise it is clipped P4 Clipped Clipped Window P2 wymax Clipped P5 P1 P7 Points Within the Window are Not Clipped P9 P8 wymin P10 Clipped wxmin wxmax

  11. Line Clipping Harder - examine the end-points of each line to see if they are in the window or not

  12. Cohen-Sutherland Algorithm [1/4] Dispense Two Simpler Case Trivially accept / Visible Trivially reject / Not Visible

  13. Brute Force Line Clipping Brute force line clipping can be performed as follows: • Don’t clip lines with both end-points within the window • For lines with one end-point inside the window and one end-point outside, calculate the intersection point (using the equation of the line) and clip from this point out

  14. Brute Force Line Clipping (cont…) • For lines with both end-points outside the window test the line for intersection with all of the window boundaries, and clip appropriately However, calculating line intersections is computationally expensive Because a scene can contain so many lines, the brute force approach to clipping is much too slow

  15. Cohen-Sutherland Clipping Algorithm An efficient line clipping algorithm The key advantage of the algorithm is that it vastly reduces the number of line intersections that must be calculated Dr. Ivan E. Sutherland co-developed the Cohen-Sutherland clipping algorithm. Sutherland is a graphics giant and includes amongst his achievements the invention of the head mounted display. Cohen is something of a mystery – can anybody find out who he was?

  16. Cohen-Sutherland Clipping

  17. Cohen-Sutherland Algorithm [2/4] A B R L P = 1 0 0 0 0 1 1 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 Test for trivial acceptance or rejection P Trivial accept: Codes for both end points are 0000 Trivial reject: Codes for both end points have a 1 in the same position.

  18. Cohen-Sutherland: World Division 3 2 1 0 above below right left Region Code Legend World space is divided into regions based on the window boundaries • Each region has a unique four bit region code • Region codes indicate the position of the regions with respect to the window

  19. Cohen-Sutherland: Labelling P11 [1010] P4 [1000] Window wymax P6 [0000] P3 [0001] P12 [0010] P5 [0000] P7 [0001] P9 [0000] P8 [0010] wymin P10 [0100] P13 [0101] P14 [0110] wxmin wxmax Every end-point is labelled with the appropriate region code

  20. Cohen-Sutherland Line Clipping • Lets us eliminate many edge clips early • Extends easily to 3D • 27 regions • 6 bits • Similar triangles still works in 3D • Just have to do it for 2 sets of similar triangles

  21. Cohen-Sutherland: Lines In The Window P11 [1010] P4 [1000] Window wymax P6 [0000] P3 [0001] P12 [0010] P5 [0000] P7 [0001] P9 [0000] P8 [0010] wymin P10 [0100] P13 [0101] P14 [0110] wxmin wxmax Lines completely contained within the window boundaries have region code [0000] for both end-points so are not clipped

  22. Cohen-Sutherland: Lines Outside The Window P11 [1010] P4 [1000] Window wymax P6 [0000] P3 [0001] P12 [0010] P5 [0000] P7 [0001] P9 [0000] P8 [0010] wymin P10 [0100] P13 [0101] P14 [0110] wxmin wxmax Any lines with a common set bit in the region codes of both end-points can be clipped • The AND operation can efficiently check this

  23. Clipping • analytically calculating the portions of primitives within the viewport

  24. Cohen-Sutherland: Other Lines Lines that cannot be identified as completely inside or outside the window may or may not cross the window interior These lines are processed as follows: • Compare an end-point outside the window to a boundary (choose any order in which to consider boundaries e.g. left, right, bottom, top) and determine how much can be discarded • If the remainder of the line is entirely inside or outside the window, retain it or clip it respectively

  25. Cohen-Sutherland: Other Lines (cont…) • Otherwise, compare the remainder of the line against the other window boundaries • Continue until the line is either discarded or a segment inside the window is found We can use the region codes to determine which window boundaries should be considered for intersection • To check if a line crosses a particular boundary we compare the appropriate bits in the region codes of its end-points • If one of these is a 1 and the other is a 0 then the line crosses the boundary

  26. Cohen-Sutherland Examples Window wymax P9 [0000] P9 [0000] wymin P10’ [0000] P10 [0100] wxmin wxmax Consider the line P9 to P10 below • Start at P10 • From the region codes of the two end-points we know the line doesn’t cross the left or right boundary • Calculate the intersection of the line with the bottom boundary to generate point P10’ • The line P9 to P10’ is completely inside the window so is retained

  27. Cohen-Sutherland Examples (cont…) P4 [1000] P4’ [1001] Window wymax P3 [0001] P3 [0001] wymin wxmin wxmax Consider the line P3 to P4 below • Start at P4 • From the region codes of the two end-points we know the line crosses the left boundary so calculate the intersection point to generate P4’ • The line P3 to P4’ is completely outside the window so is clipped

  28. Cohen-Sutherland Examples (cont…) Window wymax P7’ [0000] P8 [0010] P7 [0001] P8’ [0000] wymin wxmin wxmax Consider the line P7 to P8 below • Start at P7 • From the two region codes of the two end-points we know the line crosses the left boundary so calculate the intersection point to generate P7’

  29. Cohen-Sutherland Examples (cont…) Window wymax P7’ [0000] P8 [0010] P7 [0001] P8’ [0000] wymin wxmin wxmax Consider the line P7’ to P8 • Start at P8 • Calculate the intersection with the right boundary to generate P8’ • P7’ to P8’ is inside the window so is retained

  30. Serial Clipping 1001 1000 1010 y = top 0001 0010 y = bottom 0101 0100 0110 x = left x = right

  31. Serial Clipping 1001 1000 1010 y = top • First clip 0001 • Move (x0,y0) to (left,…) 0001 0010 y = bottom 0101 0100 0110 x = left x = right

  32. Serial Clipping 1001 1000 1010 y = top • First clip 0001 • Move (x0,y0) to (left,…) • Then clip 0010 • Move (x1,y1) to (right,…) 0001 0010 y = bottom 0101 0100 0110 x = left x = right

  33. Serial Clipping 1001 1000 1010 y = top • First clip 0001 • Move (x0,y0) to (left,…) • Then clip 0010 • Move (x1,y1) to (right,…) • Then clip 0100 • Move (x0,y0) again, now to (…,bottom) 0001 0010 y = bottom 0101 0100 0110 x = left x = right

  34. Serial Clipping 1001 1000 1010 y = top • First clip 0001 • Move (x0,y0) to (left,…) • Then clip 0010 • Move (x1,y1) to (right,…) • Then clip 0100 • Move (x0,y0) again, now to (…,bottom) • Finally clip 1000 • Move (x1,y1) again, now to (…,top) 0001 0010 y = bottom 0101 0100 0110 x = left x = right

  35. Cohen-Sutherland Worked Example Window wymax wymin wxmax wxmin

  36. Calculating Line Intersections Intersection points with the window boundaries are calculated using the line-equation parameters • Consider a line with the end-points (x1, y1) and (x2, y2) • The y-coordinate of an intersection with a vertical window boundary can be calculated using: y = y1 + m (xboundary - x1) where xboundary can be set to either wxmin or wxmax

  37. Calculating Line Intersections (cont…) • The x-coordinate of an intersection with a horizontal window boundary can be calculated using: x = x1 + (yboundary - y1)/ m where yboundary can be set to either wymin or wymax • m is the slope of the line in question and can be calculated as m = (y2 - y1) / (x2 - x1)

  38. From the following figure show the clipping lines result from the window with coordinates xmin =4, xmax =13, ymin = 4, and ymax =12. E (17, 16) (3, 13) D 12 (8, 8) C (16, 9) G 4 (14, 3) (5, 3) F H 4 13

  39. Polygon Clipping • not just clipping all boundary lines • may have to introduce new line segments

  40. Area Clipping Similarly to lines, areas must be clipped to a window boundary Consideration must be taken as to which portions of the area must be clipped

  41. Sutherland-Hodgman Area Clipping Algorithm Sutherland turns up again. This time with Gary Hodgman with whom he worked at the first ever graphics company Evans & Sutherland A technique for clipping areas developed by Sutherland & Hodgman Put simply the polygon is clipped by comparing it against each boundary in turn Original Area Clip Left Clip Right Clip Top Clip Bottom

  42. Sutherland-Hodgeman Clipping • basic idea: • consider each edge of the viewport individually • clip the polygon against the edge equation • after doing all edges, the polygon is fully clipped

  43. Sutherland-Hodgeman Clipping • basic idea: • consider each edge of the viewport individually • clip the polygon against the edge equation • after doing all edges, the polygon is fully clipped

  44. Sutherland-Hodgeman Clipping • basic idea: • consider each edge of the viewport individually • clip the polygon against the edge equation • after doing all edges, the polygon is fully clipped

  45. How many sides? Seven…

  46. Sutherland-Hodgeman Clipping inside outside inside outside inside outside inside outside p s p s p s p s p output i output no output i outputp output • edge from s to ptakes one of four cases: (blue line can be a line or a plane)

  47. Sutherland-Hodgman Area Clipping Algorithm (cont…) To clip an area against an individual boundary: • Consider each vertex in turn against the boundary • Vertices inside the boundary are saved for clipping against the next boundary • Vertices outside the boundary are clipped • If we proceed from a point inside the boundary to one outside, the intersection of the line with the boundary is saved • If we cross from the outside to the inside intersection point and the vertex are saved

  48. Sutherland-Hodgman Example S S P I P Save Point I Save Point P S P P I S Save Points I & P No Points Saved Each example shows the point being processed (P) and the previous point (S) Saved points define area clipped to the boundary in question

  49. Other Area Clipping Concerns Window Window Window Window Clipping concave areas can be a little more tricky as often superfluous lines must be removed Clipping curves requires more work • For circles we must find the two intersection points on the window boundary

  50. Clipping In 3D

More Related