Cohen Sutherland Line Clippings-Algorithm
Describe briefly the Cohen Sutherland Line Clippings Algorithm?
Expert
In Cohen Sutherland Line Clipping, the clipping trouble is simplified by dividing the region surrounding the window area into four segments, up, down, left, right, (UDLR) and assignment of number 1 and 0 to respective segments assists in positioning the area surrounding the window. However the restriction of Cohen Sutherland Line Clippings is that, this algorithm is just applicable to rectangular windows and not in any other convex shaped window.
Explain the term Z-mouse?
What is fixed point scaling?
Explain the term Color Look up table?
Specify some of the methods which is used for smoothly connecting the two line segments?
Illustrate the term covering (exterior clipping) and fixed point scaling?
Write a short note on MP3 File format?
Write down a short note on Direct view storage tubes?
Write down some of the merits and demerits of z-buffer or depth buffer.
Explain the advantages and disadvantages of Plasma panel display?
Describe in brief the low level methods (motion specific) and high level methods (motion generalized) animation.
18,76,764
1956606 Asked
3,689
Active Tutors
1426242
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!