1. OpenGL Geometric Transformations

2. OpenGL Matrix Stacks Stack processing –The top of the stack is the “current” matrix –glPushMatrix(); // Duplicate the current matrix at the top –glPopMatrix(); // Remove the matrix at the top

3. 로보트 팔 만들기

4. Hierarchical Modeling A hierarchical model is created by nesting the descriptions of subparts into one another to form a tree organization

5. Homework #2 다각형을 이용하여 움직이는 2 차원 아름다운 애니 메이션 만들기 Push/Pop Matrix 를 사용하여 2 단계 이상의 계층적 인 움직임 디자인을 할 것 –Ex): 태양계 시스템 ( 태양  지구  달 ) 사람의 움직임 ( 몸  어깨  팔꿈치  손목  손 ) 숙제제출 : 이메일 제출 (Screenshot, code, report) 숙제마감 : 4 월 28 일 수요일 23 시 59 분까지

6. Viewing Part I: Two-Dimensional Viewing Sang Il Park Sejong University Lots of slides are stolen from Jehee Lee’s

7. Two-Dimensional Viewing Two dimensional viewing transformation –From world coordinate scene description to device (screen) coordinates

8. Normalization and Viewport Transformation World coordinate clipping window Normalization square: usually [-1,1]x[-1,1] Device coordinate viewport

9. OpenGL 2D Viewing Projection Mode –glMatrixMode(GL_PROJECTION); GLU clipping-window function –gluOrtho2D(xwmin,xwmax,ywmin,ywmax); –Normalized to [-1,1]x[-1,1] OpenGL viewport function –glViewport(xvmin,xvmax,yvmin,yvmax);

10. GLUT window Functions: glutInitWindowPosition glutInitWindowSize glutCreateWindow glutDestroyWindow glutSetWindow/glutGetWindow ….. And more! See the text book pp 346~354

11. Clipping Remove portion of output primitives outside clipping window Two approaches –Clip during scan conversion: Per-pixel bounds check –Clip analytically, then scan-convert the modified primitives

12. Two-Dimensional Clipping Point clipping – trivial Line clipping –Cohen-Sutherland –Cyrus-beck –Liang-Barsky Fill-area clipping –Sutherland-Hodgeman –Weiler-Atherton Curve clipping Text clipping

13. Line Clipping Basic calculations: –Is an endpoint inside or outside the clipping window? –Find the point of intersection, if any, between a line segment and an edge of the clipping window. Both endpoints inside: trivial accept One inside: find intersection and clip Both outside: either clip or reject

14. Cohen-Sutherland Line Clipping One of the earliest algorithms for fast line clipping Identify trivial accepts and rejects by bit operations above belowrightleft Bit 4 3 2 1 0000 10001001 0001 010101000110 0010 1010 Clipping window

15. Cohen-Sutherland Line Clipping Compute region codes for two endpoints If (both codes = 0000 ) trivially accepted If (bitwise AND of both codes  0000) trivially rejected Otherwise, divide line into two segments –test intersection edges in a fixed order. (e.g., top-to-bottom, right-to-left) 0000 10001001 0001 010101000110 0010 1010 Clipping window

16. Cohen-Sutherland Line Clipping Fixed order testing and clipping cause needless clipping (external intersection)

17. Cohen-Sutherland Line Clipping This algorithm can be very efficient if it can accept and reject primitives trivially –Clip window is much larger than scene data Most primitives are accepted trivially –Clip window is much smaller than scene data Most primitives are rejected trivially Good for hardware implementation

18. Cyrus-Beck Line Clipping Use a parametric line equation Reduce the number of calculating intersections by exploiting the parametric form Notations –E i : edge of the clipping window –N i : outward normal of E i –An arbitrary point P Ei on edge E i

19. Cyrus-Beck Line Clipping

20. Solve for the value of t at the intersection of P 0 P 1 with the edge –N i · [P(t) - P Ei ] = 0 and P(t) = P 0 + t(P 1 - P 0 ) –letting D = (P 1 - P 0 ), –Where N i  0 D  0 (that is, P 0  P 1 ) N i · D  0 (if not, no intersection)

21. Cyrus-Beck Line Clipping Given a line segment P 0 P 1, find intersection points against four edges –Discard an intersection point if t  [0,1] –Label each intersection point either PE (potentially entering) or PL (potentially leaving) –Choose the smallest (PE, PL) pair that defines the clipped line

22. Liang-Barsky Line Clipping Liang-Barsky optimized Cyrus-Beck for upright rectangular clip windows P(x 1,y 1 ) Q(x 2.y 2 ) tBtB tTtT tRtR tLtL

23. Liang-Barsky Line Clipping T B RL tTtT tBtB

24. Cyrus-Beck Line Clipping Cyrus-Beck is efficient when many line segments need to be clipped Can be extended easily to convex polygon (rather than upright rectangle) clip windows

25. Nicholl-Lee-Nicholl Line Clipping Divide more cases and reduce the computation. (1) (2) (3)

26. General Clipping Window Line clipping using nonrectangular polygon clip windows –Convex polygon Cyrus-Beck algorithm can be readily extended –Concave polygon Split the concave polygon into convex polygons Vector Method for Concave Splitting Calculate edge-vector cross products in a counterclockwise order If any z component turns out to be negative, the polygon is concave

27. Polygon Fill-Area Clipping Polyline vs polygon fill-area Early rejection is useful Clipping Window Bounding box of polygon fill area

28. Sutherland-Hodgman Polygon Clipping Clip against 4 infinite clip edges in succession

29. Sutherland-Hodgman Polygon Clipping Accept a series of vertices (polygon) and outputs another series of vertices Four possible outputs

30. Sutherland-Hodgman Polygon Clipping The algorithm correctly clips convex polygons, but may display extraneous lines for concave polygons

31. Weiler-Atherton Polygon Clipping For an outside-to-inside pair of vertices, follow the polygon boundary For an inside-to-outside pair of vertices, follow the window boundary in a clockwise direction

32. Weiler-Atherton Polygon Clipping Polygon clipping using nonrectangular polygon clip windows

33. Text Clipping All-or-none text clipping –Using boundary box for the entire text All-or-non character clipping –Using boundary box for each individual character Character clipping –Vector font: Clip boundary polygons or curves –Bitmap font: Clip individual pixels

34. Three-Dimensional Viewing Sang Il Park Sejong University Lots of slides are stolen from Jehee Lee’s

35. Viewing Pipeline

36. Virtual Camera Model Viewing Transformation –The camera position and orientation is determined Projection Transformation –The selected view of a 3D scene is projected onto a view plane

37. General 3D Viewing Pipeline Modeling coordinates (MC) World coordinates (WC) Viewing coordinates (VC) Projection coordinates (PC) Normalized coordinates (NC) Device coordinates (DC)

38. Viewing-Coordinate Parameters View point (eye point or viewing position) View-plane normal vector N

39. Viewing-Coordinate Parameters Look-at point P ref View-up vector V –N and V are specified in the world coordinates –V should be perpendicular to N, but it can be difficult to a direction for V that is precisely perpendicular to N

40. Viewing-Coordinate Reference Frame The camera orientation is determined by the uvn reference frame u n v

41. World-to-Viewing Transformation Transformation from world to viewing coordinates –Translate the viewing-coordinate origin to the world- coordinate origin –Apply rotations to align the u, v, n axes with the world x w, y w, z w axes, respectively u n v

42. World-to-Viewing Transformation

43. Perspective Projection Pin-hold camera model –Put the optical center (Center Of Projection) at the origin –Put the image plane (Projection Plane) in front of the COP –The camera looks down the negative z axis we need this if we want right-handed-coordinates

44. Parallel Projection Special case of perspective projection –Distance from the COP to the PP is infinite –Also called “parallel projection” –What’s the projection matrix? Image World Slide by Steve Seitz

45. Taxonomy of Geometric Projections geometric projections parallelperspective orthographicaxonometricoblique trimetric dimetric isometric cavaliercabinet single-pointtwo-pointthree-point

46. Orthographic Transformation Preserves relative dimension The center of projection at infinity The direction of projection is parallel to a principle axis Architectural and engineering drawings

47. Axonometric Transformation Orthogonal projection that displays more than one face of an object –Projection plane is not normal to a principal axis, but DOP is perpendicular to the projection plane –Isometric, dimetric, trimetric

48. Oblique Parallel Projections Projection plane is not normal to a principal axis, but DOP is perpendicular to the projection plane Only faces of the object parallel to the projection plane are shown true size and shape

49. Oblique Parallel Projections www.maptopia.com

50. Oblique Parallel Projections

51. Typically,  is either 30˚ or 45˚ L 1 is the length of the projected side edge –Cavalier projections L 1 is the same as the original length –Cabinet projections L 1 is the half of the original length

52. Oblique Parallel Projections Cavalier projections Cabinet projections

53. Perspective Projection Pin-hold camera model –Put the optical center (Center Of Projection) at the origin –Put the image plane (Projection Plane) in front of the COP –The camera looks down the negative z axis we need this if we want right-handed-coordinates

54. Perspective Projection Projection equations –Compute intersection with PP of ray from (x,y,z) to COP –Derived using similar triangles (on board) –We get the projection by throwing out the last coordinate:

55. Homogeneous coordinates Is this a linear transformation?

56. Homogeneous coordinates Trick: add one more coordinate: Converting from homogeneous coordinates homogeneous projection coordinates homogeneous viewing coordinates

57. Perspective Projection Projection is a matrix multiply using homogeneous coordinates: divide by third coordinate This is known as perspective projection –The matrix is the projection matrix –Can also formulate as a 4x4 divide by fourth coordinate

58. Perspective Projection The projection matrix can be much involved, if the COP is different from the origin of the uvn coordinates –See the textbook for the detailed matrix

59. Traditional Classification of Projections Three principle axes of the object is assumed –The front, top, and side face of the scene is apparent

60. Traditional Classification of Projections

61. Perspective-Projection View Volume Viewing frustum –Why do we need near and far clipping plane ?

62. Normalizing Transformation Transform an arbitrary perspective-projection view volume into the canonical view volume Step 1: from frustum to parallelepiped

63. Normalizing Transformation Transform an arbitrary perspective-projection view volume into the canonical view volume Step 2: from parallelepiped to normalized

64. OpenGL 3D Viewing Functions Viewing-transformation function –glMatrixMode(GL_MODELVIEW); –gluLookAt(x0,y0,z0,xref,yref,zref,vx,vy,vz); –Default: gluLookAt(0,0,0, 0,0,-1, 0,1,0); OpenGL orthogonal-projection function –glMatrixMode(GL_PROJECTION); –gluOrtho(xwmin,xwmax, ywmin,ywmax, dnear,dfar); –Default: gluOrtho(-1,1, -1,1, -1,1); –Note that dnear and dfar must be assigned positive values z near =-dnear and z far =-dfar The near clipping plane is the view plane

65. OpenGL 3D Viewing Functions OpenGL perspective-projection function –The projection reference point is the viewing-coordinate origin –The near clipping plane is the view plane –Symmetric: gluPerspective(theta,aspect,dnear,dfar) –General: glFrustum(xwmin,xwmax,ywmin,ywmax,dnear,dfar)