Sem 4‎ > ‎CG LAB‎ > ‎

### Q12: WAP to perform rotation wrt to a point.

posted Mar 4, 2012, 8:23 AM by Neil Mathew   [ updated Mar 6, 2012, 7:36 AM ]
 SOURCE CODE:```1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167#include #include #include #include   int n; double P[3][10]; double P2[3][10];   double S[3][3]; double angle; int h,k;   double deg2rad(double deg) {    double rad= ((22.0/7.0)/180.0)*deg;   return rad;   }     void INPUT() { int ch; cout<<"\n For Polygon where No of edges (>3) = "; cin>>n;   cout<<"\n Enter the coordinates of "<>P[0][i]>>P[1][i]; P[2][i]=1; }   cout<<"\n Enter the Angle: "; cin>>angle;   cout<<"\n Scaling W.R.T which point (1/2/3...) : "; cin>>ch;   if(ch!=0) { h=P[0][ch-1]; k=P[1][ch-1]; } }     void ROTATEpoint() {                    double x=angle; // S[3][3] : Scaling MATRIX // P[3][n] : 3 x n MATRIX // P2[3][n] : Final MATRIX   //ROTATE Matrix: //1st - making the identity Matrix for(int i=0; i<3; i++) { for(int j=0; j<3; j++) {         if(i==j)     //DIAGONAL         S[i][j] = 1;         else         S[i][j] = 0; } } //2nd - making changes S[0][0] = cos (  deg2rad(x) ); S[0][1] = - sin( deg2rad(x) ); S[1][0] = sin ( deg2rad(x) ); S[1][1] = cos ( deg2rad(x) );   S[0][2] = -h*cos(deg2rad(x)) + k*sin ( deg2rad(x) ) + h; S[1][2] = -h*sin(deg2rad(x)) - k*cos ( deg2rad(x) ) + k;       // Matrix Multiplication // S(3x3)  x  P(3xN)   for(i=0; i<3; i++) { for(int j=0; j