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 briefly the term Bezier curves? Explain its uses?
Briefly describe the kind of computer graphics?
Briefly illustrate the term Joysticks? Write down its key features.
Write a short note on the term vector scan Display?
Define bundled attributes?
Illustrate the term projections. Explain briefly?
What do you understand by the term fractals?
What do you mean by view plane and view-plane normal vector?
Explain some of the advantages of the laser printer.
18,76,764
1955024 Asked
3,689
Active Tutors
1418407
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!