# Cohen-Sutherland Line Clipping Algorithm (C++)

#include
#include
#include
static int LEFT=1,RIGHT=2,BOTTOM=4,TOP=8,xl,yl,xh,yh;
int getcode(int x,int y){
int code = 0;
//Peform Bitwise OR to get outcode
if(yyl) code |=BOTTOM;
if(xxh) code |=RIGHT;
return code;
}
void main(){
int gdriver = DETECT,gmode;
initgraph(&gdriver,&gmode,”C:\TC\BGI”);
setcolor(BLUE);
cout<>xl>>yl>>xh>>yh;
rectangle(xl,yl,xh,yh);
int x1,y1,x2,y2;
cout<>x1>>y1>>x2>>y2;
line(x1,y1,x2,y2);
getch();

int outcode1=getcode(x1,y1), outcode2=getcode(x2,y2);
int accept = 0;                                                                                              //decides if line is to be drawn
while(1){
float m =(float)(y2-y1)/(x2-x1);
if(outcode1==0&&outcode2==0){                                                     //Both points inside. Accept line
accept = 1;
break;
}else if((outcode1 & outcode2)!=0){                                                  //AND of both codes != 0.Line is outside. Reject line
break;
}else{
int x,y;
int temp;
if(outcode1==0) temp = outcode2;                                                   //Decide if point1 is inside. if not calculate intersection
else temp = outcode1;

if(temp & TOP){                                   //Line clips top edge
x = x1+ (yh-y1)/m;
y = yh;
}else if(temp & BOTTOM){              //Line clips bottom edge
x = x1+ (yl-y1)/m;
y = yl;
}else if(temp & LEFT){                    //Line clips left edge
x = xl;
y = y1+ m*(xl-x1);
}else if(temp & RIGHT){                //Line clips right edge
x = xh;
y = y1+ m*(xh-x1);
}
if(temp == outcode1){                   //Check which point we had selected earlier as temp, and replace its co-ordinates
x1 = x;
y1 = y;
outcode1 = getcode(x1,y1);
}else{
x2 = x;
y2 = y;
outcode2 = getcode(x2,y2);
}
}
}
setcolor(WHITE);
cout<<“After clipping:”;
if(accept) line(x1,y1,x2,y2);
getch();
closegraph();
}

Tech Tip: Migrate your programming and testing environment into the cloud to access your essential programming tools remotely from anywhere on any device (PC/Mac/Android/iOS) with high performance hosted windows virtual desktop from CloudDesktopOnline.com with endurable technical assistance from www.Apps4Rent.com.

## 6 thoughts on “Cohen-Sutherland Line Clipping Algorithm (C++)”

1. Nimish says:

Thank you very much for this brother! 🙂

1. Darshan Gajara says:

I’m glad that this could help you in some way 🙂

2. SoundEagle says:

This post and other similar ones remind me of the olden university days of completing assignments in a computer graphics course. Thank you, Darshan! 🙂

1. Darshan Gajara says:

Spot on! I started sharing the programs written by me and my friends here, so that others don’t have to go through the shitty assignments as we did.

2. vansh says:

Good program easy to understand .

1. Darshan Gajara says:

Happy to help, Vansh.

This site uses Akismet to reduce spam. Learn how your comment data is processed.