8. 2D Transformation.cpp

/*Write C++/Java program to draw 2-D object and perform following basic transformations, 
a) Scaling 
b) Translation 
c) Rotation 
Use operator overloading. */

#include<iostream>
#include<stdlib.h>
#include<graphics.h>
#include<math.h>

using namespace std;

class POLYGON
{
    private:
        int p[10][10],Trans_result[10][10],Trans_matrix[10][10];
        float Rotation_result[10][10],Rotation_matrix[10][10];
        float Scaling_result[10][10],Scaling_matrix[10][10];
        float Shearing_result[10][10],Shearing_matrix[10][10];
        int Reflection_result[10][10],Reflection_matrix[10][10];

    public:
	int accept_poly(int [][10]);
	void draw_poly(int [][10],int);
	void draw_polyfloat(float [][10],int);
	void matmult(int [][10],int [][10],int,int,int,int [][10]);
	void matmultfloat(float [][10],int [][10],int,int,int,float [][10]);
	void shearing(int [][10],int);
	void scaling(int [][10],int);
	void rotation(int [][10],int);
	void translation(int [][10],int);
	void reflection(int [][10],int);
};

int POLYGON :: accept_poly(int p[][10])
{
	int i,n;
	cout<<"\n\nEnter number of vertices : ";
	cin>>n;
	for(i=0;i<n;i++)
	{
		cout<<"\n\nEnter (x,y) Co-ordinate of point P"<<i<<" : ";
		cin >> p[i][0] >> p[i][1];
		p[i][2] = 1;
	}
	
	for(i=0;i<n;i++)
	{
		cout<<"\n";
		for(int j=0;j<3;j++)
		{
			cout<<p[i][j]<<"\t\t";
		}
	}

	return n;
}
void POLYGON :: draw_poly(int p[][10], int n)
{
	int i,gd = DETECT,gm;
	initgraph(&gd,&gm,NULL);
	line(320,0,320,480);
	line(0,240,640,240);

	for(i=0;i<n;i++)
	{
		if(i<n-1)
		{
			line(p[i][0]+320, -p[i][1]+240, p[i+1][0]+320, -p[i+1][1]+240);
			
		}		
		else
			line(p[i][0]+320, -p[i][1]+240, p[0][0]+320, -p[0][1]+240);
	}
	

	
}

void POLYGON :: draw_polyfloat(float p[][10], int n)
{
	int i,gd = DETECT,gm;
	initgraph(&gd,&gm,NULL);
	line(320,0,320,480);
	line(0,240,640,240);

	for(i=0;i<n;i++)
	{
		if(i<n-1)
		{
			line(p[i][0]+320, -p[i][1]+240, p[i+1][0]+320, -p[i+1][1]+240);
			
		}		
		else
			line(p[i][0]+320, -p[i][1]+240, p[0][0]+320, -p[0][1]+240);
	}
	
	
}


void POLYGON :: translation(int p[10][10],int n)
{
	int tx,ty,i,j; int i1,j1,k1,r1,c1,c2;
        r1=n;c1=c2=3;
	cout << "\n\nEnter X-Translation tx : ";
	cin >> tx;
	cout << "\n\nEnter Y-Translation ty : ";
	cin >> ty;
	for(i=0;i<3;i++)
	for(j=0;j<3;j++)
		Trans_matrix[i][j] = 0;
	Trans_matrix[0][0] = Trans_matrix[1][1] = Trans_matrix[2][2] = 1;
	Trans_matrix[2][0] = tx;
	Trans_matrix[2][1] = ty;
   
	for(i1=0;i1<10;i1++)
	for(j1=0;j1<10;j1++)
		Trans_result[i1][j1] = 0;
	for(i1=0;i1<r1;i1++)
	for(j1=0;j1<c2;j1++)
	for(k1=0;k1<c1;k1++)
		Trans_result[i1][j1] = Trans_result[i1][j1]+(p[i1][k1] * Trans_matrix[k1][j1]);
	cout << "\n\nPolygon after Translation : ";
	draw_poly(Trans_result,n);
}

void POLYGON :: rotation(int p[][10],int n)
{
	float type,Ang,Sinang,Cosang;
        int i,j; int i1,j1,k1,r1,c1,c2;
        r1=n;c1=c2=3;
	cout << "\n\nEnter the angle of rotation in degrees : ";
	cin >> Ang;
	cout << "\n\n* * * * Rotation Types * * * *";
	cout << "\n\n1.Clockwise Rotation \n\n2.Anti-Clockwise Rotation ";
	cout << "\n\nEnter your choice(1-2): ";
	cin >> type;
	Ang = (Ang * 6.2832)/360;
	Sinang = sin(Ang);
	Cosang = cos(Ang);
          cout<<"Mark1";
	for(i=0;i<3;i++)
	for(j=0;j<3;j++)
		Rotation_matrix[i][j] = 0;
        cout<<"Mark2";
	Rotation_matrix[0][0] = Rotation_matrix[1][1] = Cosang;
	Rotation_matrix[0][1] = Rotation_matrix[1][0] = Sinang;
	Rotation_matrix[2][2] = 1;
	if(type == 1)
		Rotation_matrix[0][1] = -Sinang;
	else
		Rotation_matrix[1][0] = -Sinang;
	
        for(i1=0;i1<10;i1++)
	for(j1=0;j1<10;j1++)
		Rotation_result[i1][j1] = 0;
	for(i1=0;i1<r1;i1++)
	for(j1=0;j1<c2;j1++)
	for(k1=0;k1<c1;k1++)
		Rotation_result[i1][j1] = Rotation_result[i1][j1]+(p[i1][k1] * Rotation_matrix[k1][j1]);

	cout << "\n\nPolygon after Rotation : ";
        for(i=0;i<n;i++)
	{
		cout<<"\n";
		for(int j=0;j<3;j++)
		{
			cout<<Rotation_result[i][j]<<"\t\t";
		}
	}
	draw_polyfloat(Rotation_result,n);
}

void POLYGON :: scaling(int p[][10],int n)
{
	float Sx,Sy;
        int i,j; int i1,j1,k1,r1,c1,c2;
        r1=n;c1=c2=3;
	cout<<"\n\nEnter X-Scaling Sx : ";
	cin>>Sx;
	cout<<"\n\nEnter Y-Scaling Sy : ";
	cin>>Sy;
        
	for(i=0;i<3;i++)
	{
		for(j=0;j<3;j++)
		{	
			Scaling_matrix[i][j] = 0;
		}
	}

	Scaling_matrix[0][0] = Sx;
	Scaling_matrix[0][1] = 0;
	Scaling_matrix[0][2] = 0;
	Scaling_matrix[1][0] = 0;
	Scaling_matrix[1][1] = Sy;
	Scaling_matrix[1][2] = 0;
	Scaling_matrix[2][0] = 0;
	Scaling_matrix[2][1] = 0;
	Scaling_matrix[2][2] = 1;
	
        for(i1=0;i1<10;i1++)
	for(j1=0;j1<10;j1++)
		Scaling_result[i1][j1] = 0;
	for(i1=0;i1<r1;i1++)
	for(j1=0;j1<c2;j1++)
	for(k1=0;k1<c1;k1++)
		Scaling_result[i1][j1] = Scaling_result[i1][j1]+(p[i1][k1] * Scaling_matrix[k1][j1]);

	cout<<"\n\nPolygon after Scaling : ";
	draw_polyfloat(Scaling_result,n);
}

void POLYGON :: shearing(int p[][10],int n)
{
	float Sx,Sy,type; int i,j;
        int i1,j1,k1,r1,c1,c2;
        r1=n;c1=c2=3;
	for(i=0;i<3;i++)
	for(j=0;j<3;j++)
	{
		if(i == j)
			Shearing_matrix[i][j] = 1;
		else
			Shearing_matrix[i][j] = 0;
	}
	cout << "\n\n* * * * Shearing Types * * * *";
	cout << "\n\n1.X-Direction Shear \n\n2.Y-Direction Shear ";
	cout << "\n\nEnter your choice(1-2) : ";
	cin >> type;
	if(type == 1)
	{
		cout << "\n\nEnter X-Shear Sx : ";
		cin >> Sx;
		Shearing_matrix[1][0] = Sx;
	}
	else
	{
		cout << "\n\nEnter Y-Shear Sy : ";
		cin >> Sy;
		Shearing_matrix[0][1] = Sy;
	}
	
        
        for(i1=0;i1<10;i1++)
	for(j1=0;j1<10;j1++)
	Shearing_result[i1][j1] = 0;
	for(i1=0;i1<r1;i1++)
	for(j1=0;j1<c2;j1++)
	for(k1=0;k1<c1;k1++)
		Shearing_result[i1][j1] = Shearing_result[i1][j1]+(p[i1][k1] * Shearing_matrix[k1][j1]);

	cout << "\n\nPolygon after Shearing : ";
	draw_polyfloat(Shearing_result,n);
}

void POLYGON :: reflection(int p[][10],int n)
{
	int type,i,j;
      
        int i1,j1,k1,r1,c1,c2;
  r1=n;c1=c2=3;
	cout << "\n\n* * * * Reflection Types * * * *";
	cout << "\n\n1.About X-Axis \n\n2.About Y-Axis \n\n3.About Origin\n\n4.About Line y = x \n\n5.About Line y = -x \n\nEnter your choice(1-5) : ";
	cin >> type;
	for(i=0;i<3;i++)
	for(j=0;j<3;j++)
	{
			Reflection_matrix[i][j] = 0;
	}
	switch(type)
	{
		case 1:
			Reflection_matrix[0][0] = 1;
                        Reflection_matrix[1][1] = -1;
                        Reflection_matrix[2][2] = 1;
			break;
		case 2:
			Reflection_matrix[0][0] = -1;
                        Reflection_matrix[1][1] = 1;
                        Reflection_matrix[2][2] = 1;
			break;
		case 3:
			Reflection_matrix[0][0] = -1;
                        Reflection_matrix[1][1] = -1;
                        Reflection_matrix[2][2] = 1;
			break;
		case 4:
			Reflection_matrix[0][1] = 1;
			Reflection_matrix[1][0] = 1;
			Reflection_matrix[2][2] = 1;
			break;
		case 5:
			Reflection_matrix[0][1] = -1;
			Reflection_matrix[1][0] = -1;
			Reflection_matrix[2][2] = 1;
			break;
	}
	
        for(i1=0;i1<10;i1++)
	for(j1=0;j1<10;j1++)
		Reflection_result[i1][j1] = 0;
	for(i1=0;i1<r1;i1++)
	for(j1=0;j1<c2;j1++)
	for(k1=0;k1<c1;k1++)
		Reflection_result[i1][j1] = Reflection_result[i1][j1]+(p[i1][k1] * Reflection_matrix[k1][j1]);

	cout << "\n\n\t\tPolygon after Reflection : ";
//cout << "\n\n\t\tPolygon after Rotation…";
        for(i=0;i<n;i++)
	{
		cout<<"\n";
		for(int j=0;j<3;j++)
		{
			cout<<Reflection_result[i][j]<<"\t\t";
		}
	}
	draw_poly(Reflection_result,n);
//closegraph();
}



int main()
{
	int ch,n,p[10][10];
	POLYGON p1;
	cout<<"\n\n* * * * 2-D TRANSFORMATION * * * *";
	n= p1.accept_poly(p);
	
	cout <<"\n\nOriginal Polygon : ";
	p1.draw_poly(p,n);
	do
	{
		
                int ch;
	        cout<<"\n\n* * * * 2-D TRANSFORMATION * * * *";
		cout<<"\n\n1.Translation \n\n2.Scaling \n\n3.Rotation \
	        \n\n4.Reflection \n\n5.Shearing \n\n6.Exit";
	        cout<<"\n\nEnter your choice(1-6) : ";
	        cin>>ch;
	   
		switch(ch)
		{
			case 1:
				
				p1.translation(p,n);
				break;

			case 2:
				
				p1.scaling(p,n);
				break;

			case 3:
				
				p1.rotation(p,n);
				break;

			case 4:
				
				p1.reflection(p,n);
				break;

			case 5:
				
				p1.shearing(p,n);
				break;

			case 6:
				exit(0);
		}
	}while(1);
	return 0;
}