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.
What is solid modelling and an intuitive interface?
Distinguish between emissive and non emissive displays?
What do you understand by the term perspective projection? Illustrate briefly?
Explain the term scan code?
What do you understand by the term fractals?
What are the various clipping operations are there? Briefly describe it.
List out all the advantages and disadvantages of DVST?
Explain the term plane of projection?
Explain the term rotation?
Write down a short note on JPEG Graphics and also write down its application?
18,76,764
1934929 Asked
3,689
Active Tutors
1419305
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!