EEL 5771-001 Introduction to Computer Graphics

EEL 5771-001 Introduction to Computer Graphics PPT2: Graphics Output Primitives PPT and video are due : no later than September 13, 5:00 PM 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.

Team members’ contributions Member [name]: Member [name]: Member [name]: Member [name]:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

OpenGL Area Fill Content outline: • Polygons, triangles, strips • Quads and quad strips

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

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

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

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

Character Handling Content outline: • Bitmap characters • Stroke characters

EEL 5771-001 Introduction to Computer Graphics