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
is there any plugin available to draw a picture in wpf dotnet programming using microsoft visio?


Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel


Define hermite interpolation in deatail description with example?

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

deffrent between vecgen algorithm and bresenham line algorithm in computer graphic

What is view distance?  The view plane normal vector is a directed line segment from the view plane to the view reference point. The length of this directed line segment is ref

Adobe Premiere - Softwares for computer animation It just like the name as is generated by Adobe. This is a tool used to composite digitized video, stills and applies a variet