BCA Semester 5 – Computer Graphics and Animation – Unit 3: Clipping (7Hrs)

Question 1

Explain Cohen Sutherland line clipping algorithm. Let ABCD be the rectangular window with A(20,20), B(90,20), C(90,70) and D(20,70). Use Cohen Sutherland algorithm to find the region codes and ellipse

Marks: 10

Year: 2021 Final TU

Definition: Cohen-Sutherland Line Clipping Algorithm - Cohen-Sutherland algorithm is a line clipping algorithm used to clip a line against a rectangular window. - Uses region codes (outcodes) to qui

Question 2

Explain Sutherland-Hodgeman Polygon Clipping algorithm and trace it to clip a polygon with end points P(10, 30), Q(25, 35), R(35, 50), S(60, 30), T(45, 28), U(40, 15) against a window whose lower left

Marks: 10

Year: 2022 Final TU

Sutherland-Hodgeman Polygon Clipping Algorithm Definition - Sutherland-Hodgeman algorithm clips a polygon against a rectangular window edge by edge. - It produces a new polygon that lies entirely i

Question 3

How region codes are used in Cohen-Sutherland algorithm to clip the line segments? Find the clipping coordinates for lines PQ and RS with P(20, 5), Q(40, 30) and R(20, 30), S(80, 60) against the windo

Marks: 10

Year: 2024 Final TU

1. Region Codes in Cohen-Sutherland Algorithm Definition - Region codes are 4-bit codes assigned to endpoints of a line to determine their position relative to the clipping window. - Each bit repre

Question 4

What is polygon clipping? Explain Sutherland Hodgman algorithm for polygon clipping.

Marks: 5

Year: 2020 Final TU

Definition: Polygon Clipping Polygon clipping is the process of removing the portions of a polygon that lie outside a given clipping window and retaining only the part of the polygon that lies inside