(a) Given the clipping window $A(20, 20)$, $B(60, 20)$, $C(60, 40)$,…

Question

(a) Given the clipping window $A(20, 20)$, $B(60, 20)$, $C(60, 40)$, $D(20, 40)$. Using Sutherland Cohen algorithm find the visible portion of line segment joining the points $P(40, 80)$, $Q(120, 30)$.

Related pages

• Cohen-Sutherland Line Clipping — topic
• Computer Graphics syllabus

More PYQs on Cohen-Sutherland Line Clipping

• Use the Cohen Sutherland outcode algorithm to clip two lines P1(40,15) to P2(75,45) and P3(70,20) to P4(100, 10) against a window A(50,10), B(80,10), C(80,40),…
• a) Explain the working of Cohen Sutherland algorithm for clipping line. Illustrate by taking suitable example. b) Draw the flowchart illustrating the logic of…