Algorithm scan-line, Computer Graphics

Algorithm (scan-line):

For each scan line perform from step (1) to (3).

1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background-color.

2) For each polygon means, get all pixels on the current scan-line as S1 that lies inside the polygon. For all of these x-values:

a) Compute the depth z of the polygon at (x,y)

b) If z < depth [x], set depth [x] =z and intensity consequent to the polygon's shading.

3) When all polygons have been identified; the values comprised in the intensity array present the solution and can be a duplicate in the frame-buffer.

 

Posted Date: 3/22/2013 8:46:58 AM | Location : United States







Related Discussions:- Algorithm scan-line, Assignment Help, Ask Question on Algorithm scan-line, Get Answer, Expert's Help, Algorithm scan-line Discussions

Write discussion on Algorithm scan-line
Your posts are moderated
Related Questions
explain vecgen algoritham

What is shearing?  The shearing transformation actually slants the object with the X direction or the Y direction as needed.ie; this transformation slants the shape of an obje

Example1: Translate a square ABCD along with the coordinates as: A(0,0),B(5,0),C(5,5),D(0,5) via 2 units in x-direction and 3 units in y-direction. Solution: We can show the

How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex? Solution : see the following figure 13, now the window is non-convex in s


Image Editing Tools These are specializing and influential tools for enhancing and re-touching existing bit-mapped images. Such applications also give several of the features a

Arguments made in favour of Analog Sound Shape of the waveforms: from digital signals sound reconstructed which is claimed to be harsher and unnatural compared to analog si



Explain window to view port transformation