Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This chapter include objectives overview: Identify the four categories of application software, describe characteristics of a user interface, identify the key features of widely used business programs, identify the key features of widely used graphics and multimedia programs,. | Computer Graphics Lecture 22 Fasih ur Rehman Last Class Clipping Algorithms Today’s Agenda Clipping Algorithms Line in Parametric form Line in Parametric form Liang-Barsky Clipping A line parallel to a clipping window edge has pk = 0 for that boundary. If for that k, qk 0, the line proceeds inside to outside. For nonzero pk, u = qk/pk gives the intersection point. 5. For each line, calculate u1 and u2. For u1, look at boundaries for which pk 0 (inside view window). Take u2 to be the minimum of (1, qk/pk). If u1 > u2, the line is outside and therefore rejected. Summary Clipping References Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Top-down Approach with OpenGL (Sixth | Computer Graphics Lecture 22 Fasih ur Rehman Last Class Clipping Algorithms Today’s Agenda Clipping Algorithms Line in Parametric form Line in Parametric form Liang-Barsky Clipping A line parallel to a clipping window edge has pk = 0 for that boundary. If for that k, qk 0, the line proceeds inside to outside. For nonzero pk, u = qk/pk gives the intersection point. 5. For each line, calculate u1 and u2. For u1, look at boundaries for which pk 0 (inside view window). Take u2 to be the minimum of (1, qk/pk). If u1 > u2, the line is outside and therefore rejected. Summary Clipping References Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Top-down Approach with OpenGL (Sixth Edition) by Edward . | Computer Graphics Lecture 22 Fasih ur Rehman Last Class Clipping Algorithms Today’s Agenda Clipping Algorithms Line in Parametric form Line in Parametric form Liang-Barsky Clipping A line parallel to a clipping window edge has pk = 0 for that boundary. If for that k, qk 0, the line proceeds inside to outside. For nonzero pk, u = qk/pk gives the intersection point. 5. For each line, calculate u1 and u2. For u1, look at boundaries for which pk 0 (inside view window). Take u2 to be the minimum of (1, qk/pk). If u1 > u2, the line is outside and therefore rejected. Summary Clipping References Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Top-down Approach with OpenGL (Sixth Edition) by Edward Angel.
