Home / Engineering / Computer Graphics MCQs / Page 10
Computer Graphics MCQs | Page - 10
Dear candidates you will find MCQ questions of Computer Graphics here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
M
Q. 91) Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111
M
Q. 92) Which one is not valid out code to perform trivial accept / reject test in line clipping
M
Q. 93) Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?
M
Q. 94) If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle
M
Q. 95) determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying the rules
M
Q. 96) Outcode / Region Code used in Line Clipping is of size ____ bits.
M
Q. 97) In Line Clipping algorithm, the two dimensional space is divided into ___ regions.
M
Q. 98) Is 0011 valid region code / outcode used in Line Clipping algorithm?
M
Q. 99) Cohen – Sutherland line clipping algorithm was developed in ____
M
Q. 100) Primitive types of clipping algorithms are
Explore Sets
Explore More Categories
Click on category to learn MCQs of that category.Electronics and Communication Engineering
Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.
