Algorithm for scan line method
Write down the algorithm for scan line method?
Expert
Algorithms for scan line method are as follows:
For each scan line execute step 1 via step 3.
1) For all pixels on a scan line, set depth[x] = 1.0(max value) & intensity[x] = background color.
2) For each polygon in the scene, find all pixels on the present scan line (say s1) that lies in the polygon. For each of these x-values:
i). compute the depth z of the polygon at (x,y)
ii). When z < depth[x], set depth[x] = z and intensity corresponding to the polygons shading
3) Subsequent to all the polygons have been taken into consider; the values enclosed in the intensity array symbolize the solution and can be copied into a frame buffer.
The advantage of scan line algorithm is that every time, we are functioning with one dimensional array that is, x[0….x-max] for color not a 2-D array as in depth buffer algorithm.
Explain the advantages and disadvantages of Plasma panel display?
How many key frames are required to generate an animation film series with duplications, having time duration of 5 minutes?
Describe Heated metal cathode and Control grid?
Write a short note on the term phong shading?
What is pseudo animation?
Define the term attribute parameter? Also illustrate the different attribute of a line?
Describe Interlaced Scan for image capture?
What are the merits of introducing the matrix form of translation? Explain briefly?
What do you mean by the term output primitive? Also specify the term ‘jaggies’?
Illustrate the advantages of electrostatic plotters?
18,76,764
1938642 Asked
3,689
Active Tutors
1429360
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!