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.
Briefly describe the kind of computer graphics?
What do you mean by the term color look up table? Explain it in short.
What does it mean by RGB?
Explain term feasibility study? Specify some of the contents that feasibility report should consists of?
Distinguish between impact and non-impact printers?
What do you mean by the term Sprite? Briefly illustrate it?
Explain the term affine transformation?
What is meant by scan code and refreshing of the screen?
What do you mean by scan line polygon algorithm?
Write down the different types of graphic images?
18,76,764
1957290 Asked
3,689
Active Tutors
1461229
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!