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.
What do you understand by the term projector?
What is raster scan? Describe briefly?
What are the features of Inkjet printers?
Illustrate the difference between bitBlt and pixBlt?
What do you mean by retracing? Define vertical retracing as well as horizontal?
What do you mean by the term Line cap? Illustrate it in brief.
Illustrate the term flood fill algorithm?
Explain the term Line cap?
Explain the different types of 2D Transformation
What do you mean by the term Polygon mesh? Also describe various polygon meshes?
18,76,764
1945466 Asked
3,689
Active Tutors
1457891
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!