EEL 5771 001 Introduction to Computer Graphics PPT

EEL 5771 -001 Introduction to Computer Graphics PPT 5: Two-dimensional viewing PPT and video are due : no later than October 2 Submit to: lpiegl@gmail. com This template file is just an outline of the presentation that you need to complete. Additional pages will be necessary to fully explore the topic above. Each page should contain adequate text as well as illustrations. You are free to use all publicly available information (text as well as graphics) as long as the sources are properly acknowledged. 1

Team members’ contributions Member [name]: 2

2 -D Viewing Pipeline Content outline: • Multiple windows • What and where we want to see 3

2 -D Viewing Pipeline Content outline: • Transformation pipeline from modeling coordinate to device coordinates 4

2 -D Viewing Pipeline Content outline: • Mapping world coordinates to the viewing system 5

2 -D Viewing Pipeline Content outline: • From clipping window to normalized viewport • Detailed math and illustrations 6

Clipping algorithms Content outline: • Principles of clipping: points and lines 7

Cohen-Sutherland Clipping Content outline: • Region bits • Trivial rejection 8

Cohen-Sutherland Clipping Content outline: • Pseudocode algorithm • Examples 9

Liang-Barsky Clipping Content outline: • Principles and math • Potentially entering and leaving points 10

Liang-Barsky Clipping Content outline: • Pseudocode algorithm • Clipping examples 11

NLN Clipping Algorithm Content outline: • Explanation and examples 12

Clipping against Concave Clipping Windows Content outline: • Method and example 13

Area Clipping Algorithms Content outline: • Explanation and examples 14

Re-entrant Polygon Clipping Content outline: • Algorithm • Detailed example 15

Weiler-Atherton Polygon Clipping Content outline: • Algorithm • Detailed example 16

Circle Clipping Content outline: • Algorithm • Example 17

Text Clipping Content outline: • Ways to clip text • Examples 18