Cohen Sutherland 2-Dimensional Line Clipping Algorithm CS1355-Graphics and Multimedia Lab

These source code contain the following important function clips clip clip.input() clearviewport() clip.call() by using these function it will draw the line clipping these called Cohen Sutherland line clipping . These cohen Sutherland 2D Line clipping algorithm was generate in c++ program source code
Source Code Line clipping algorithm CS1355-Graphics and Multimedia Lab
#include<iostream.h>
#include<conio.h>
#include<graphics.h>
#include<dos.h>
#include<math.h>
class clips
{
private:
int x1[10],y1[10],x2[10],y2[10],xmin,ymin,xmax,ymax,n,i,a1[5], b1[5],c1[5],d1[5],a2[5],b2[5],c2[5],d2[5],j,l,m,x,y;
public:
void input();
void call();
};
void clips::input()
{
cout<<"Enter the values of Windows:\n";
cin>>xmin>>ymin>>xmax>>ymax;
rectangle(xmin,ymin,xmax,ymax);
cout<<"Enter the No: of Lines:\n";
cin>>n;
cout<<"Enter the Line Co-ordinate one by one\n";
for(i=1;i<=n;i++)
{
cin>>x1[i]>>y1[i]>>x2[i]>>y2[i];
line(x1[i],y1[i],x2[i],y2[i]);
}
getch();
}
void clips::call()
{
cout<<"The Clipped Image";
rectangle(xmin,ymin,xmax,ymax);
for(i=1;i<=n;i++)
{
if(x1[i]>xmin)
{
a1[i]=0;
}
else
{
a1[i]=1;
}
if(x1[i]<xmax)
{
b1[i]=0;
}

else
{
b1[i]=1;
}
if(y1[i]>ymin)
{
c1[i]=0;
}
else
{
c1[i]=1;
}
if(y1[i]<ymax)
{
d1[i]=0;
}
Else
{
d1[i]=0;
}
if(x2[i]>xmin)
{
a2[i]=0;
}
else
{
a2[i]=1;
}
if(x2[i]<xmax)
{
b2[i]=0;
}
else
{
b2[i]=1;
}
if(y2[i]>ymin)
{
c2[i]=0;
}
else
{
c2[i]=1;
}
if(y2[i]<ymax)
{
d2[i]=0;
}

else
{
d2[i]=1;
}
if(a1[i]==0&&b1[i]==0&&c1[i]==0&&d1[i]==0&&a2[i]==0&&b2[i]==0
&&c2[i]==0&&d2[i]==0)
{
line(x1[i],y1[i],x2[i],y2[i]);
}
else if(((a1[i]&&b1[i]&&c1[i]&&d1[i]==1))&&((a1[i]&&b2[i]&&c2[i]
&&d2[i]==1)))
{
cout<<" ";
}
else
{
j=y2[i]-y1[i];
l=x2[i]-x1[i];
m=j/l;
if(a1[i]==0&&b1[i]==0&&c1[i]==0&&d1[i]==0)
{
if(x2[i]<xmin)
{
x=xmin;
y=y1[i]+(m*(xmin-x1[i]));
}
else if(x2[i]>xmax)
{
x=xmax;
y=y1[i]+(m*(xmax-x1[i]));
}
else if(y2[i]<ymin)
{
y=ymin;
x=x1[i]+((ymin-y1[i])/m);
}
else if(y2[i]>ymax)
{
y=ymax;
x=x1[i]+((ymax-y1[i])/m);
}
line(x,y,x1[i],y1[i]);
}
else if(a2[i]==0&&b2[i]==0&&c2[i]==0&&d2[i]==0)
{
if(x1[i]<xmin)
{
x=xmin;
y=y1[i]+(m*(xmin-x1[i]));
}
else if(x1[i]>xmax)
{
x=xmax;
y=y1[i]+(m*(xmax-x1[i]));
}
else if(y1[i]<ymin)
{
y=ymin;
x=x1[i]+((ymin-y1[i])/m);
}
else if(y1[i]>ymax)
{
y=ymax;
x=x1[i]+((ymax-y1[i])/m);
}
line(x,y,x2[i],y2[i]);
}
}
}
}
void main()
{
int gd=DETECT,gm;
initgraph(&gd,&gm,"C:/tc/bgi");
clips clip;
clip.input();
delay(10);
clearviewport();
clip.call();
getch();
closegraph();
}
Line clipping algorithm in C++ output

Cohen Sutherland 2-Dimensional Line Clipping

Related post