At R be Rectangular window whose lower left head corner is at l(-3,1) and upper right head corner is at R(2,6).Find the region codes for the endpoints A(-4,2),B(-1,7), C(-1,5),D(3,8),G(1,-2),H(3,3),I(-4,7) and J(-2,10) code example

Example: Cohen Sutherland Line Clipping Algorithm: In the algorithm, first of all, it is detected whether line lies inside the screen or it is outside the screen. All lines come under any one of the following categories: Visible Not Visible Clipping Case

Cohen Sutherland Line Clipping Algorithm:
In the algorithm, first of all, it is detected whether line lies inside the screen or it is outside the screen. All lines come under any one of the following categories:

Visible
Not Visible
Clipping Case