1. Trang chủ
  2. » Công Nghệ Thông Tin

Lecture Computer graphics: Lecture 23 - Fasih ur Rehman

16 39 0

Đ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

Thông tin cơ bản

Định dạng
Số trang 16
Dung lượng 29,73 KB

Nội dung

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 23 Fasih ur Rehman Last Class • Clipping Algorithms Today’s Agenda • Polygon Clipping Polygon Clipping • Difficult task • Polygon clipping may result in – Original Polygon – New polygon – Nothing • Trivial Accept • Trivial Reject Polygon Clipping Polygon Clipping Original Polygon No Polygon New Polygon Sutherland-Hodgman Clipping • • • Consider each edge of the view window individually Clip the polygon against the view window edge’s equation After doing all edges, the polygon is fully clipped Polygon Clipping Polygon Clipping Polygon Clipping Polygon Clipping 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 ... Clipping Summary • Clipping References • • Fundamentals of Computer Graphics Third Edition by Peter Shirley and Steve Marschner Interactive Computer Graphics, A Topdown Approach with OpenGL (Sixth... Trivial Reject Polygon Clipping Polygon Clipping Original Polygon No Polygon New Polygon Sutherland-Hodgman Clipping • • • Consider each edge of the view window individually Clip the polygon against

Ngày đăng: 30/01/2020, 07:36