Computer Graphics Part 6 (Rasterization)

Card Set Information

Author:
Anonymous
ID:
217105
Filename:
Computer Graphics Part 6 (Rasterization)
Updated:
2013-05-01 18:24:34
Tags:
computer graphics informatics science
Folders:

Description:
University of Edinburgh School of Informartics Copmuter Graphics (Level 10) Revision Cards created by Simon M.
Show Answers:

Home > Flashcards > Print Preview

The flashcards below were created by user Anonymous on FreezingBlue Flashcards. What would you like to do?


  1. What is another name for rasterization?
    scan conversion
  2. 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)
  3. 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.
  4. span extrema pseudo code
  5. How are the edges managed in the spanline alogithm?
  6. Explain how the global edge table works
    • Edges are bucket sorted according to their minimum Y
  7. How does the active edge table work?
  8. 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
  9. Why are triangles easy to rasterize?
    • always convex
    • always ona¬† plane
    • never selfintersects
    • easy to interpolate data
  10. Barycentric coordinates - derivation
  11. How are barycentric coordinates used within the context of triangle rasterization?
  12. copmuting the barycentric coordinates
  13. How is trianlge rasterization done using barycentric coordinates and a bounding box?
  14. barycentric coordinates exercise
  15. What are mean value coordinates?
  16. Polygon Decompsoition algorithm
    • If a vertex is inside that triangle, form a new triangle with leftmost inside vertx and A and procceed as before.

What would you like to do?

Home > Flashcards > Print Preview