Skip to content

Computer Graphics

CSE · Quiz · Summer 26

Paper 3 of 4Section F · Batch 65 · SUPAN ROY (2)Switch

Section F · Batch 65

Paper 3 of 4

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Faculty of Science & Information Technology Department of Computer Science & Engineering QUIZ - 02 Course Code: CSE411, Course Title: Computer Graphics Time: 1 Hour Marks: 15 1. [Figure: A clipping window with a line segment AB crossing it from outside] Given a clipping window with xmin = -2, xmax = 5, ymin = -1, ymax = 3 and a line segment joining A(3, -3) and B(7, 1) a. Determine the category of the line. If the line is a clipping candidate, perform the clipping with proper mathematical steps. [3] [CO2] b. Explain the technology used to generate the color in the clipping window shown above. [2] [CO1] 2. [Figure: A polygon with vertices V1, V2, V3, V4, V5, V6 inside a dotted clipping rectangle ABCD] a. Perform clipping of the above polygon using the Sutherland-Hodgeman algorithm. [4] [CO2] b. Perform clipping of the same polygon using the Weiler-Atherton algorithm. [4] [CO2] c. State which algorithm is more suitable in this case and justify your answer. [2] [CO3]