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.
Illustrate briefly the term Surface of revolution?
What is raster scan? Describe briefly?
Explain the advantages and disadvantages of Penetration techniques?
What is meant by the term shearing?
What is the different representation schemes utilized in three dimensional objects?
State difference between the impact and non-impact printers?
Explain the term computer graphics animation? What is meant by pseudo animation? Explain the normal speed of the visual animation?
Illustrate the term covering (exterior clipping) and fixed point scaling?
Define the term frame and key frame? Briefly describe both the terms.
Illustrate the difference between bitBlt and pixBlt?
18,76,764
1931532 Asked
3,689
Active Tutors
1457110
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!