Cohen Sutherland Line Clippings Algorithm
Describe Cohen Sutherland Line Clippings Algorithm in brief?
Expert
In Cohen Sutherland Line Clipping, the clipping trouble is simplified by dividing the region surrounding the window region into the four segments, up, down, left, right, (or UDLR) and allocation of number 1 and 0 to corresponding segments helps in positioning the area surrounding the window. But the restriction of Cohen Sutherland Line Clippings is that this algorithm is just valid to rectangular windows and not to other convex shaped window.
Write a short note on Scan-Line Method? Describe with an appropriate diagram?
Explain the different types of 2D Transformation
What is a Blobby object?
What is meant by the term Random scan/Raster scan displays?
Consider three different raster systems with resolutions of 640 x 480, 1280 x 1024, and 2560 x 2048? a) What size is frame buffer (in bytes) for each of these systems to store 12 bits per pixel?
Define and illustrate the functioning of the video controller of the Raster scan systems?
Briefly discuss the concept of Hidden surface removal algorithms and Phong shading?
Why the use of hidden line removing algorithm mainly utilized? Give reasons.
Write down the features of Shadow mask method. Briefly explain it.
Write differences between the raster and the random scan displays.
18,76,764
1937746 Asked
3,689
Active Tutors
1419028
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!