Computer Graphics MCQs with Answers
Practice important Computer Graphics MCQs with answers and explanations.
Multiple Choice Questions
Q491: In Liang-Barsky, if pk = 0 and qk ≥ 0, the line is ______.
- A: Rejected
- B: Accepted
- C: Parallel and inside
- D: Parallel and outside
View Answer
C
Q492: Clipping individual points is _______ than clipping lines.
- A: More complex
- B: Easier
- C: More expensive
- D: Slower
View Answer
B
Q493: In clipping, the term "interior" refers to points lying _______.
- A: Inside the clip rectangle
- B: Outside the clip rectangle
- C: On the canvas border
- D: Outside screen boundary
View Answer
A
Q494: The intersection points G' and H' in the example are ______.
- A: Exterior
- B: Interior
- C: Undefined
- D: Parallel
View Answer
B
Q495: Which algorithm divides a line if trivial accept/reject tests fail?
- A: Liang-Barsky
- B: Cohen-Sutherland
- C: DDA
- D: Bresenham's
View Answer
B
Q496: What is the main purpose of polygon clipping?
- A: To shrink polygons
- B: To simplify colors
- C: To manage visibility within a region
- D: To animate shapes
View Answer
C
Q497: The Sutherland-Hodgeman algorithm clips a polygon against a ________ clip polygon.
- A: concave
- B: convex
- C: circular
- D: spiral
View Answer
B
Q498: Which polygon clipping algorithm can handle polygons with holes?
- A: Bresenham algorithm
- B: Sutherland-Hodgeman algorithm
- C: Weiler-Atherton algorithm
- D: Cohen-Sutherland algorithm
View Answer
C
Q499: In polygon clipping, each polygon edge must be tested against _______.
- A: one edge only
- B: each edge of the clip rectangle
- C: diagonal edges only
- D: no edge
View Answer
B
Q500: In polygon clipping, a concave polygon may be clipped into ______.
- A: one polygon
- B: two or more polygons
- C: no polygons
- D: a line
View Answer
B