Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Chapter: 15
Q501:
Sutherland-Hodgeman algorithm uses which strategy?
A. Divide and Conquer
B. Merge Sort
C. Brute Force
D. Greedy
Correct Answer:
A
Chapter: 15
Q502:
How does the Sutherland-Hodgeman algorithm clip a polygon?
A. Clip against all edges at once
B. Clip sequentially against each boundary
C. Randomly clip boundaries
D. Skip clipping
Correct Answer:
B
Chapter: 15
Q503:
In the Sutherland-Hodgeman method, how many clip edges are typically considered for a rectangle?
A. Two
B. Three
C. Four
D. Five
Correct Answer:
C
Chapter: 15
Q504:
Case 1 in polygon clipping (vertex i to vertex i+1) indicates:
A. Both vertices inside
B. First inside, second outside
C. Both outside
D. First outside, second inside
Correct Answer:
A
Chapter: 15
Q505:
In which case during clipping is the intersection point saved and the endpoint saved?
A. Case 2
B. Case 3
C. Case 4
D. Case 1
Correct Answer:
C
Chapter: 15
Q506:
When both vertices are outside the visible region, what action is taken?
A. Save both points
B. Save one point
C. Save intersection only
D. Save nothing
Correct Answer:
D
Chapter: 15
Q507:
The Weiler-Atherton algorithm modifies vertex-processing to correctly display ______ polygons.
A. convex
B. concave
C. spherical
D. cylindrical
Correct Answer:
B
Chapter: 15
Q508:
In Sutherland-Hodgeman, after clipping against one edge, the ______ vertices are saved for next stage.
A. removed
B. modified
C. kept
D. new
Correct Answer:
C
Chapter: 15
Q509:
If both vertices are inside during clipping, output is:
A. Both points
B. Only intersection
C. Only endpoint
D. Only first point
Correct Answer:
C
Chapter: 15
Q510:
Weiler-Atherton algorithm is particularly useful for handling polygons with _______.
A. small size
B. large color variations
C. holes and concavities
D. straight lines
Correct Answer:
C
Chapter: 15
Q511:
The direction for Weiler-Atherton algorithm processing is based on:
A. processing speed
B. polygon-processing direction
C. memory usage
D. random selection
Correct Answer:
B
Chapter: 15
Q512:
When using Weiler-Atherton, outside-to-inside vertex pairs are followed along _______.
A. window boundary
B. polygon boundary
C. diagonal path
D. none
Correct Answer:
B
Chapter: 15
Q513:
The shortcoming of Sutherland-Hodgeman appears when clipping _______ polygons.
A. convex
B. open
C. concave
D. simple
Correct Answer:
C
Chapter: 15
Q514:
Which method could be used to correct the Sutherland-Hodgeman output for concave polygons?
A. Splitting into convex polygons
B. Ignoring concave parts
C. Using only outer edges
D. Shrinking the polygon
Correct Answer:
A
Chapter: 15
Q515:
Clipping a polygon against four edges successively is called _______.
A. Pipelining
B. Parallelism
C. Stacking
D. Reordering
Correct Answer:
A
Chapter: 15
Q516:
In pipeline clipping, after a vertex passes all boundaries successfully, it is _______.
A. deleted
B. skipped
C. entered into the output array
D. redrawn
Correct Answer:
C
Chapter: 15
Q517:
A polygon defined by sequence of vertices and edges is known as a _______.
A. curve
B. rectangle
C. polygon
D. spline
Correct Answer:
C
Chapter: 15
Q518:
If a polygon is open, clipping becomes ________.
A. easier
B. complicated
C. redundant
D. unnecessary
Correct Answer:
B
Chapter: 15
Q519:
In Sutherland-Hodgeman, intersections are easy to find because _______ coordinates are already known.
A. speed and time
B. X and Y
C. color and texture
D. shape and size
Correct Answer:
B
Chapter: 15
Q520:
The Weiler-Atherton technique was developed for _______ identification.
A. sound
B. visible surface
C. invisible objects
D. hidden nodes
Correct Answer:
B