Rasterization Flashcards

1
Q

Differential digital analyzer

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

bresenham’s algorithm

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

smothing with rasterize lines

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the scanline algorithm

A

we want to rasterize polygons
* generate intersections with all lines of the polygon.
* sort intersections along x
* fill pixel between pairs of intersections
* Rule of odd parity. Start with a parity of 0. when an intersection is crossed flip the parity. If parity is 1 draw.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

scanline algorithm with besenhams algorithm

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

triangle rasterization

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

triangle rasterization of small triangle

A
  • small triangles cause useless computation.
  • only check small box around the triangle and not the whole raster
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

hierarchical rasterization

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

3D Triangle Raserization

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly