Lecture Computer graphics: Lecture 19 - Fasih ur Rehman

16 49 0
Lecture Computer graphics: Lecture 19 - Fasih ur Rehman

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

Thông tin tài liệu

This chapter discuss the purpose of the components required for successful communications; describe these uses of computer communications: wireless messaging services, wireless Internet access points, cybercafés, global positioning systems, collaboration, groupware, voice mail, and Web services;

Computer Graphics Lecture 19 Fasih ur Rehman Last Class • Rasterization • Fragment Processing • Clipping Today’s Agenda • Clipping Clipping • Identification of the portions of geometric primitives by analytical calculations within the view windows Clipping • Not to clip means – Rasterize outside framebuffer – time to convert pixels outside the window will be wasted Clipping Approach • For each line segment – – for each edge of the window view • find intersection points • pick nearest points if anything is left draw it Clipping • • The process of determining which primitives, or parts of primitives, fit within the clipping or view volume The portions of all primitives that can possibly be displayed (lie in the cube) – w ≥ x ≥ -w – w ≥ y ≥ -w – w ≥ z ≥ -w Line Clipping • A clipper decides which primitives, or parts of primitives can possibly be displayed and be passed on to rasterizer – Primitives that fit within the specified view volume pass through the clipper, or are accepted – Primitives that cannot appear on the display are eliminated, or rejected or culled – Primitives that are partially within the view volume must be clipped such that any part lying outside the volume is removed Accepted Rejected Clipped Clipping Algorithms • Test both end points of line – Both ends on correct side of the view window (same) edge • Trivial Accept Clipping Algorithms • Test both end points of line – Both ends on wrong side of the view window (same) edge • Trivial Reject Clipping Algorithms • Combining the above two – If both endpoints lie inside all the edges of view window, accept the line “trivially” – If both endpoints lie outside the same edge of view window, reject the line “trivially” – Otherwise, split the line in two segments and accept and reject each segment trivially Summary • Clipping References • • Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Topdown Approach with OpenGL (Sixth Edition) by Edward Angel ... portions of all primitives that can possibly be displayed (lie in the cube) – w ≥ x ≥ -w – w ≥ y ≥ -w – w ≥ z ≥ -w Line Clipping • A clipper decides which primitives, or parts of primitives can possibly... trivially Summary • Clipping References • • Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Topdown Approach with OpenGL (Sixth

Ngày đăng: 30/01/2020, 08:19

Mục lục

  • Slide 1

  • Last Class

  • Today’s Agenda

  • Clipping

  • Clipping

  • Clipping Approach

  • Clipping

  • Line Clipping

  • Accepted

  • Rejected

  • Clipped

  • Clipping Algorithms

  • Clipping Algorithms

  • Clipping Algorithms

  • Summary

  • References

Tài liệu cùng người dùng

Tài liệu liên quan