EEL 5771 001 Introduction to Computer Graphics PPT

EEL 5771 -001 Introduction to Computer Graphics PPT 2: Graphics Output Primitives PPT and video are due : no later than September 11 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

Coordinate Frames Content outline: • Coordinate frames, screen coordinates • Graphics programing: points and lines 3

Line Drawing Algorithms Content outline: • Line drawing principles • The math behind a simple line drawing algorithm 4

Line Drawing Algorithms Content outline: • The digital differential analyzer (DDA) algorithm • The principle and pseudo-code 5

Line Drawing Algorithms Content outline: • Bresenham’s algorithm – – The principle The math The pseudo-code Detailed example 6

Line Drawing Algorithms Content outline: • Pixel addressing • General addressing, addressing for x/y increment 7

Line Drawing Algorithms: Order Dependence Content outline: • The problem of order dependence • Possible solutions 8

Line Drawing Algorithms Content outline: • The problem of clipping • Side and bottom clipping 9

Line Drawing Algorithms Content outline: • The problem of intensity as the function of the slope • Potential solutions 10

Circle Algorithms Content outline: • Circle algorithms via polygonal approximation • Circle algorithms via implicit functions 11

Circle Algorithms Content outline: • Circle raster (integer) algorithms – – Extension of Bresenham’s line algorithm The math The code Worked example 12

Ellipse Algorithms Content outline: • Ellipse raster (integer) algorithms – – Extension of Bresenham’s line algorithm The math The code Worked example 13

Pixel Addressing Content outline: • Pixel addressing for lines • Mathematical vs. raster lines 14

Pixel Addressing Content outline: • Pixel addressing for rectangles • Graphics convention in rectangle drawing 15

Pixel Addressing Content outline: • Pixel addressing for circles/ellipses • Graphics convention in circle drawing 16

Area Fill Methods Content outline: • Concave and convex polygons • Polygon split 17

Area Fill Methods Content outline: • Area fill with Boolean operation • Data structure for polygonal objects 18

Plane Equations Content outline: • General implicit form • Three-point form • Fitting to a random data set via the eingen-vector method 19

Open. GL Area Fill Content outline: • Polygons, triangles, strips • Quads and quad strips 20

Vertex Arrays Content outline: • Data structure for vertex arrays • Sample code for polygonal objects 21

Pixel Array Primitives Content outline: • Bitmaps and pixmaps • Storage in hardware 22

Pixel Array Primitives Content outline: • Bit-shape representations • Code segment for storage and application 23

Pixel Array Primitives Content outline: • Pixel drawing • Double buffering • Buffers for stereo imaging 24

Character Handling Content outline: • Bitmap characters • Stroke characters 25