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.
List out the merits and demerits of Plasma panel display?
What do you mean by Perspective projection?
Write down a brief note on the term entertainment which is the application of computer animation?
What do you mean by Ambient Reflection? Illustrate its main features.
What are the various kinds of parallel projections? Write a short note on it.
Distinguish between Motion Specific Animation and Motion Generalized Animation?
Illustrate the term soft fill? Also briefly describe kerned character?
Define the term frame and key frame? Briefly describe both the terms.
Illustrate the benefits of rendering through patch splitting?
What are information and data, and how are they associated in a database?
18,76,764
1940207 Asked
3,689
Active Tutors
1415528
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!