Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Multiple Choice Questions
Q511: The direction for Weiler-Atherton algorithm processing is based on:
- A: processing speed
- B: polygon-processing direction
- C: memory usage
- D: random selection
View Answer
B
Q512: When using Weiler-Atherton, outside-to-inside vertex pairs are followed along _______.
- A: window boundary
- B: polygon boundary
- C: diagonal path
- D: none
View Answer
B
Q513: The shortcoming of Sutherland-Hodgeman appears when clipping _______ polygons.
- A: convex
- B: open
- C: concave
- D: simple
View Answer
C
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
View Answer
A
Q515: Clipping a polygon against four edges successively is called _______.
- A: Pipelining
- B: Parallelism
- C: Stacking
- D: Reordering
View Answer
A
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
View Answer
C
Q517: A polygon defined by sequence of vertices and edges is known as a _______.
- A: curve
- B: rectangle
- C: polygon
- D: spline
View Answer
C
Q518: If a polygon is open, clipping becomes ________.
- A: easier
- B: complicated
- C: redundant
- D: unnecessary
View Answer
B
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
View Answer
B
Q520: The Weiler-Atherton technique was developed for _______ identification.
- A: sound
- B: visible surface
- C: invisible objects
- D: hidden nodes
View Answer
B