Computer Graphics Entrance Exams Online Exam Quiz
Computer Graphics Entrance Exams GK Quiz. Question and Answers related to Computer Graphics Entrance Exams. MCQ (Multiple Choice Questions with answers about Computer Graphics Entrance Exams
How many edges of the clipping are/is present in 2D?
Options
A : 1
B : 2
C : 3
D : 4
How many polygons are used in this method?
Options
A : 4
B : 3
C : 2
D : 1
In a convex polygon, each of the interior angles is less than ____degrees.
Options
A : 90
B : 180
C : 360
D : 45
One of the drawbacks of Sutherland- Hodgeman algorithm is that it can’t produce ____________ areas.
Options
A : connected
B : multiple
C : discrete
D : circular
If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the ___________ edge.
Options
A : left edge
B : right edge
C : top edge
D : bottom edge
Sutherland-Hodgeman clipping is an example of_________________ algorithm.
Options
A : line clipping
B : polygon clipping
C : text clipping
D : curve clipping
Only vertices from the subject polygon that are on the _______________ are selected.
Options
A : lower half
B : boundary
C : opaque side
D : visible side
We can correctly clip a polygon by processing the polygon boundary as a whole against each ___________
Options
A : side wall
B : top edge
C : window edge
D : bottom edge
If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have coincident edges.
Options
A : True
B : False
C :
D :
The process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next.
Options
A : True
B : False
C :
D :
Computer Graphics 2d Reflection Shear more Online Exam Quiz
Computer Graphics 2d Reflection Shear
Computer Graphics Aptitude Test
Computer Graphics Area Sampling
Computer Graphics Character Generation
Computer Graphics Clipping Operations
Computer Graphics Interview Freshers