Computer Graphics Part 6 (Rasterization)
Home > Flashcards > Print Preview
The flashcards below were created by user
Anonymous
on
FreezingBlue Flashcards. What would you like to do?

What is another name for rasterization?
scan conversion

Describe the scanline algorithm (3 steps)
 span extrema: only turn on pixels on interior to avoid intruding other polygons (round up values on left, round down on the right)

Explain the process of the span extrema and why it is used?
 computing intersections of every line is really expensive and requires floating point arithmetic, instead use span extrema to manually "test out" the span extrema line by line, with simply incrementation of x, every time y overfloaws  thereby avoid floating point arithmetic.


How are the edges managed in the spanline alogithm?

Explain how the global edge table works
 Edges are bucket sorted according to their minimum Y

How does the active edge table work?

Name two polygon fill rules
 1. do not include horizontal edges in the tables
 2. Vertices  if local max or min, count twice; otherwise count once to assure consistency

Why are triangles easy to rasterize?
 always convex
 always ona plane
 never selfintersects
 easy to interpolate data

Barycentric coordinates  derivation

How are barycentric coordinates used within the context of triangle rasterization?

copmuting the barycentric coordinates

How is trianlge rasterization done using barycentric coordinates and a bounding box?

barycentric coordinates exercise

What are mean value coordinates?

Polygon Decompsoition algorithm
 If a vertex is inside that triangle, form a new triangle with leftmost inside vertx and A and procceed as before.