CS 184: COMPUTER GRAPHICS

Lecture #16 -- We: 3/17, 1999.

PREVIOUS < - - - - > CS 184 HOME < - - - - > CURRENT < - - - - > NEXT

Preparation:

Read:  Ch. 3.6 "Filling Polygons", Ch. 19.2.8 "Filled Primitives",  Ch. 18.3.8 "Rasterization"

Lecture Topics

Discussion of Quiz#2

Review of:

Polygon Filling, Rasterization

Inside/Outside Tests: Winding Number

The Sampling Paradigm:
A pictorial description of the requirements for a proper scan conversion algorithm.
Run this Java applet that demonstrates scan conversion.
 

The (Sweeping) Scan-Line Algorithm

Processing one polygon at a time:
Datastructures
Preprocessing
Scan-line processing
Hidden feature elimination; Z-buffering

Alternative approach: Processing all polygons simultaneously:
Differences to basic approach above.


New Homework Assignment:

ASG#7:  "Scan Conversion"
DUE: Thursday 4/1/99, 11:59pm.
NOTE that you have double the amount of time -- this will also count double the amount of points !
CAN BE DONE WITH YOUR PARTNER OF CHOICE !


--> Next Lecture

<-- Up to CS 184 HomePage


Page Editor: Carlo H. Séquin