Rasterization Algorithm

/* Start at Vertex VMin */

/*Do Bottom Triangle First, followed by Top Triangle */

Y = VMin(y); Eleft = EMaj; ERight = EBot;

LeftX = VMin(x); RightX = VMin(x);

lines = Bot.lines;

for (I = 0; I < lines; I++) {

DoSpan (Y, LeftX, RightX); /* LeftX - RightX = # of fragments in span*/

LeftX = LeftX + Eleft.dxdy;

RightX = RightX + Eright.dxdy;

Y = Y + 1;

}

/* Now do Top Triangle */

Eleft = EMaj; Eright = ETop;

lines = Top.lines;

for (I = 0; I < lines; I++) {

DoSpan (Y, LeftX, RightX);

LeftX = LeftX + Eleft.dxdy;

RightX = RightX + Eright.dxdy;

Y = Y + 1;

}

Previous slide

Next slide

Back to first slide

View graphic version