├── Simran_500039296_1.cpp ├── Simran_500039296_2.cpp ├── Simran_500039296_3.cpp ├── Simran_500039296_4.cpp ├── Simran_500039296_5.cpp ├── Simran_500039296_6.cpp ├── Simran_500039296_7.cpp ├── Simran_500039296_8.cpp ├── license.txt ├── project.cpp ├── readme.txt └── seirpinski.cpp /Simran_500039296_1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | void RenderString(float x, float y, void *font, const char* string) 9 | { 10 | char *c; 11 | glColor3f(0.91, 0.91, 0.91); 12 | glRasterPos2f(x, y); 13 | for(int i=0;string[i]!='\0';i++) 14 | glutBitmapCharacter(font, string[i]); 15 | } 16 | void display(void) 17 | { 18 | 19 | glClear (GL_COLOR_BUFFER_BIT); 20 | glColor3f(1.0, 0.0, 0.0); 21 | glBegin(GL_POLYGON); 22 | glVertex2f (-0.25, 0); 23 | glVertex2f (0.25, 0); 24 | glVertex2f (0, 0.5); 25 | glEnd(); 26 | RenderString(-0.75f, 0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Simran, R134214067"); 27 | RenderString(-0.75f, -0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Coloured triangle"); 28 | glFlush (); 29 | } 30 | 31 | void init (void) 32 | { 33 | glClearColor(0.15, 0.15, 0.15, 0.0); 34 | } 35 | 36 | int main(int argc, char** argv) 37 | { 38 | glutInit(&argc, argv); 39 | glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB); 40 | glutInitWindowSize (250, 250); 41 | glutInitWindowPosition (100, 100); 42 | glutCreateWindow ("R134214067"); 43 | init (); 44 | glutDisplayFunc(display); 45 | glutMainLoop(); 46 | return 0; 47 | } -------------------------------------------------------------------------------- /Simran_500039296_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | void RenderString(float x, float y, void *font, const char* string) 7 | { 8 | char *c; 9 | glColor3f(0.91, 0.91, 0.91); 10 | glRasterPos2f(x, y); 11 | for(int i=0;string[i]!='\0';i++) 12 | glutBitmapCharacter(font, string[i]); 13 | } 14 | void display(void) 15 | { 16 | 17 | glClear (GL_COLOR_BUFFER_BIT); 18 | glColor3f(1.0, 0.0, 0.0); 19 | glBegin(GL_POLYGON); 20 | glVertex2f (-0.25, 0); 21 | glVertex2f (0.25, 0); 22 | glVertex2f (0, 0.5); 23 | glEnd(); 24 | glBegin(GL_POLYGON); 25 | glColor3f(0.0, 1.0, 0.0); 26 | glVertex2f (-0.25, 0); 27 | glColor3f(1.0, 0.0, 0.0); 28 | glVertex2f (-0.75, 0); 29 | glColor3f(0.0, 0.0, 1.0); 30 | glVertex2f (-0.5, -0.5); 31 | glEnd(); 32 | RenderString(-0.75f, 0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Simran, R134214067"); 33 | RenderString(-0.85f, -0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Two Coloured triangles"); 34 | glFlush (); 35 | } 36 | 37 | void init (void) 38 | { 39 | glClearColor(0.15, 0.15, 0.15, 0.0); 40 | } 41 | 42 | int main(int argc, char** argv) 43 | { 44 | glutInit(&argc, argv); 45 | glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB); 46 | glutInitWindowSize (250, 250); 47 | glutInitWindowPosition (100, 100); 48 | glutCreateWindow ("R134214067"); 49 | init (); 50 | glutDisplayFunc(display); 51 | glutMainLoop(); 52 | return 0; 53 | } -------------------------------------------------------------------------------- /Simran_500039296_3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | //#include 5 | #include 6 | #include 7 | #include 8 | bool flagr=false; 9 | bool flagl=false; 10 | using namespace std; 11 | void RenderString(float x, float y, void *font, const char* string) 12 | { 13 | char *c; 14 | glColor3f(0.91, 0.91, 0.91); 15 | glRasterPos2f(x, y); 16 | for(int i=0;string[i]!='\0';i++) 17 | glutBitmapCharacter(font, string[i]); 18 | } 19 | 20 | //circle 21 | void circle(float r, float g, float b, float xc,float yc) 22 | { 23 | glBegin(GL_TRIANGLE_FAN); 24 | for(int i=0;i<100;i++) 25 | { 26 | float theta=(2.0f)*(3.1415926f)*float(i)/(float)(100); 27 | float x=(0.05f)*cosf(theta); 28 | float y=(0.05f)*sinf(theta); 29 | glColor3f(r, g, b); 30 | glVertex2f(x+xc, y+yc); 31 | } 32 | glEnd(); 33 | } 34 | 35 | void display(void) 36 | { 37 | 38 | glClear (GL_COLOR_BUFFER_BIT); 39 | glBegin(GL_POLYGON); 40 | glColor3f(0.804, 0.522, 0.247); 41 | glVertex2f (-0.75, -0.50); 42 | glVertex2f (-0.75, 0.15); 43 | glVertex2f (0.75, 0.15); 44 | glVertex2f (0.75, -0.50); 45 | glEnd(); 46 | glBegin(GL_POLYGON); 47 | glColor3f(0.647, 0.165, 0.165); 48 | glVertex2f (-0.5, -0.50); 49 | glVertex2f (-0.5, -0.30); 50 | glVertex2f (-0.3, -0.30); 51 | glVertex2f (-0.3, -0.50); 52 | glEnd(); 53 | glBegin(GL_POLYGON); 54 | glColor3f(0.647, 0.165, 0.165); 55 | glVertex2f (0.5, -0.50); 56 | glVertex2f (0.5, -0.30); 57 | glVertex2f (0.3, -0.30); 58 | glVertex2f (0.3, -0.50); 59 | glEnd(); 60 | glBegin(GL_POLYGON); 61 | glColor3f(0.871, 0.722, 0.529); 62 | glVertex2f (-0.75, 0.0); 63 | glVertex2f (-0.75, -0.30); 64 | glVertex2f (-0.6, -0.30); 65 | glVertex2f (-0.6, 0.0); 66 | glEnd(); 67 | glBegin(GL_POLYGON); 68 | glColor3f(0.871, 0.722, 0.529); 69 | glVertex2f (0.75, 0.0); 70 | glVertex2f (0.75, -0.30); 71 | glVertex2f (0.6, -0.30); 72 | glVertex2f (0.6, 0.0); 73 | glEnd(); 74 | glBegin(GL_POLYGON); 75 | glColor3f(0.941, 0.902, 0.549); 76 | glVertex2f (-0.2, -0.150); 77 | glVertex2f (-0.2, 0.150); 78 | glVertex2f (0.2, 0.150); 79 | glVertex2f (0.2, -0.150); 80 | glEnd(); 81 | glBegin(GL_POLYGON); 82 | glColor3f(0.545, 0.271, 0.075); 83 | glVertex2f (-0.15, -0.150); 84 | glVertex2f (-0.15, 0.); 85 | glVertex2f (0.15, 0); 86 | glVertex2f (0.15, -0.150); 87 | glEnd(); 88 | glBegin(GL_POLYGON); 89 | glColor3f(0.941, 0.902, 0.549); 90 | glVertex2f (-0.1, 0.150); 91 | glVertex2f (0.1, 0.150); 92 | glVertex2f (0.0, 0.450); 93 | glEnd(); 94 | glBegin(GL_POLYGON); 95 | glColor3f(0.804, 0.522, 0.247); 96 | glVertex2f (-0.75, 0.150); 97 | glVertex2f (-0.5, 0.15); 98 | glVertex2f (-0.625, 0.45); 99 | glEnd(); 100 | glBegin(GL_POLYGON); 101 | glColor3f(0.804, 0.522, 0.247); 102 | glVertex2f (0.75, 0.150); 103 | glVertex2f (0.5, 0.15); 104 | glVertex2f (0.625, 0.45); 105 | glEnd(); 106 | circle(0.94, 0.66, 0.02, 0.7,0.8); 107 | if(flagl==false) 108 | { 109 | circle(0.96, 0.66, 0.71,-0.625,0.3); 110 | } 111 | else 112 | if(flagl==true) 113 | { 114 | circle(0.184, 0.310, 0.310, -0.625,0.3); 115 | } 116 | if(flagr==false) 117 | { 118 | circle(0.184, 0.310, 0.310, 0.625,0.3); 119 | } 120 | else 121 | if(flagr==true) 122 | { 123 | 124 | circle(0.96, 0.66, 0.71, 0.625,0.3); 125 | } 126 | 127 | RenderString(-0.75f, 0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Simran, R134214067"); 128 | RenderString(-0.75f, -0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Hut"); 129 | glFlush (); 130 | } 131 | void myMouse(int button, int state, int x, int y) 132 | { 133 | float mx=float(x)/(700.0f)*(2)-1; 134 | float my=float(y)/(700.0f)*2-1; 135 | my=-my; 136 | float vall=(mx+0.625)*(mx+0.625)+(my-0.3)*(my-0.3)-(0.05f)*(0.05f); 137 | float valr=(mx-0.625)*(mx-0.625)+(my-0.3)*(my-0.3)-(0.05f)*(0.05f); 138 | if(button == GLUT_LEFT_BUTTON && state == GLUT_DOWN) 139 | { 140 | if(vall<=0) 141 | { 142 | flagl=!flagl; 143 | glutPostRedisplay(); 144 | } 145 | if(valr<=0) 146 | { 147 | flagr=!flagr; 148 | glutPostRedisplay(); 149 | } 150 | } 151 | } 152 | void init (void) 153 | { 154 | glClearColor(0.15, 0.15, 0.15, 0.0); 155 | } 156 | 157 | int main(int argc, char** argv) 158 | { 159 | glutInit(&argc, argv); 160 | glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB); 161 | glutInitWindowSize (700, 700); 162 | glutInitWindowPosition (100, 100); 163 | glutCreateWindow ("R134214067"); 164 | init (); 165 | glutMouseFunc(myMouse); 166 | glutDisplayFunc(display); 167 | glutMainLoop(); 168 | return 0; 169 | } 170 | -------------------------------------------------------------------------------- /Simran_500039296_4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | using namespace std; 10 | 11 | vector >coord; 12 | bool flagb=false,flagd=false; 13 | void RenderString(float x, float y, void *font, const char* string) 14 | { 15 | char *c; 16 | glColor3f(0.91, 0.91, 0.91); 17 | glRasterPos2f(x, y); 18 | for(int i=0;string[i]!='\0';i++) 19 | glutBitmapCharacter(font, string[i]); 20 | } 21 | 22 | void display(void) 23 | { 24 | 25 | glClear (GL_COLOR_BUFFER_BIT); 26 | RenderString(-0.75f, 0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "Simran, R134214067"); 27 | RenderString(-0.75f, -0.8f, GLUT_BITMAP_TIMES_ROMAN_24, "DDA and Bresenham's Algorithm"); 28 | glFlush (); 29 | } 30 | 31 | void init (void) 32 | { 33 | glClearColor(0.15, 0.15, 0.15, 0.0); 34 | } 35 | 36 | void dda() 37 | { 38 | float x=coord[0].first,y=coord[0].second; 39 | float dx=coord[1].first-x,dy=coord[1].second-y; 40 | int length=(abs(dx)>abs(dy))?(abs(dx))*500:(abs(dy))*500; 41 | float xInc,yInc; 42 | xInc=dx/length; 43 | yInc=dy/length; 44 | 45 | glColor3f(1.0, 0.0, 0.0); 46 | glBegin(GL_POINTS); 47 | for(int i=0;i0) 97 | { 98 | if(dx>dy) 99 | { 100 | p=2*dy-dx; 101 | while(x<=max(x1,x2) && y<=max(y1,y2)) 102 | { 103 | if(p<0) 104 | { 105 | glVertex2f(x,y); 106 | x=x+0.001; 107 | p=p+2*dy; 108 | } 109 | else 110 | { 111 | glVertex2f(x,y); 112 | x=x+0.001; 113 | y=y+0.001; 114 | p=p+2*dy-2*dx; 115 | } 116 | } 117 | } 118 | else 119 | { 120 | p=2*dx-dy; 121 | while(x<=max(x1,x2) && y<=max(y1,y2)) 122 | { 123 | if(p<0) 124 | { 125 | glVertex2f(x,y); 126 | y=y+0.001; 127 | p=p+2*dx; 128 | } 129 | else 130 | { 131 | glVertex2f(x,y); 132 | x=x+0.001; 133 | y=y+0.001; 134 | p=p+2*dx-2*dy; 135 | } 136 | } 137 | } 138 | } 139 | else 140 | if(dy<0) 141 | { 142 | if(dx>abs(dy)) 143 | { 144 | p=-2*dy-dx; 145 | while(x<=max(x1,x2) && y<=max(y1,y2)) 146 | { 147 | if(p<0) 148 | { 149 | glVertex2f(x,y); 150 | //mx++; 151 | x=x+0.001; 152 | p=p-2*dy; 153 | } 154 | else 155 | { 156 | glVertex2f(x,y); 157 | x=x+0.001; 158 | y=y-0.001; 159 | p=p-2*dy-2*dx; 160 | } 161 | } 162 | } 163 | else 164 | { 165 | p=2*dx+dy; 166 | while(x<=max(x1,x2) && y<=max(y1,y2)) 167 | { 168 | if(p<0) 169 | { 170 | glVertex2f(x,y); 171 | y=y-0.001; 172 | p=p+2*dx; 173 | } 174 | else 175 | { 176 | glVertex2f(x,y); 177 | x=x+0.001; 178 | y=y-0.001; 179 | p=p+2*dx+2*dy; 180 | } 181 | } 182 | } 183 | } 184 | glEnd(); 185 | glFlush(); 186 | } 187 | 188 | } 189 | 190 | void myMouse(int button, int state, int x, int y) 191 | { 192 | float mx=float(x)/(700.0f)*(2)-1; 193 | float my=float(y)/(700.0f)*2-1; 194 | my=-my; 195 | if(button==GLUT_LEFT_BUTTON && state==GLUT_DOWN) 196 | { 197 | coord.push_back(make_pair(mx,my)); 198 | if(coord.size()==2) 199 | { 200 | if(flagd==true) 201 | { 202 | dda(); 203 | flagd=false; 204 | } 205 | if(flagb==true) 206 | { 207 | bresenham(); 208 | flagb=false; 209 | } 210 | coord.clear(); 211 | } 212 | } 213 | } 214 | 215 | void keypr(unsigned char ch, int x, int y) 216 | { 217 | if(ch==32) 218 | { 219 | glutPostRedisplay(); 220 | } 221 | if(ch==66) 222 | { 223 | flagb=true; 224 | } 225 | else 226 | if(ch==68) 227 | { 228 | flagd=true; 229 | } 230 | } 231 | int main(int argc, char** argv) 232 | { 233 | glutInit(&argc, argv); 234 | glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB); 235 | glutInitWindowSize (700, 700); 236 | glutInitWindowPosition (100, 100); 237 | glutCreateWindow ("R134214067"); 238 | init (); 239 | glutDisplayFunc(display); 240 | glutMouseFunc(myMouse); 241 | glutKeyboardFunc(keypr); 242 | glutMainLoop(); 243 | return 0; 244 | } -------------------------------------------------------------------------------- /Simran_500039296_5.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | using namespace std; 10 | float a=400,b=300; 11 | int p,q; 12 | void RenderString(float x, float y, void *font, const char* string) 13 | { 14 | char *c; 15 | glColor3f(0.0, 0.0, 0.0); 16 | glRasterPos2f(x, y); 17 | for(int i=0;string[i]!='\0';i++) 18 | glutBitmapCharacter(font, string[i]); 19 | } 20 | 21 | void polar_circle(float x, float y, float r) 22 | { 23 | glBegin(GL_POINTS); 24 | glColor3f(0.0, 0.0, 0.0); 25 | for(int theta=0;theta<=360;theta++) 26 | { 27 | float xx=x+r*cos(theta); 28 | float yy=y+r*sin(theta); 29 | glVertex2f(xx,yy); 30 | } 31 | glEnd(); 32 | glFlush(); 33 | } 34 | 35 | void polar_ellipse(float x, float y) 36 | { 37 | glBegin(GL_POINTS); 38 | glColor3f(0.0, 0.0, 0.0); 39 | for(int theta=0;theta<=360;theta++) 40 | { 41 | float xx=x+a*cos(theta); 42 | float yy=y+b*sin(theta); 43 | glVertex2f(xx,yy); 44 | } 45 | glEnd(); 46 | glFlush(); 47 | } 48 | 49 | void midpoint_circle(float x, float y, float r) 50 | { 51 | int xx=0,yy=r; 52 | int pk; 53 | pk=5/4-r; 54 | glBegin(GL_POINTS); 55 | glColor3f(0.0, 0.0, 0.0); 56 | while(xx<=yy) 57 | { 58 | if(pk<0) 59 | { 60 | xx=xx+1; 61 | pk=pk+2*xx+1; 62 | } 63 | else 64 | { 65 | xx=xx+1; 66 | yy=yy-1; 67 | pk=pk+2*xx-2*yy+1; 68 | } 69 | glVertex2f(x+xx,y+yy); 70 | glVertex2f(x+yy,y+xx); 71 | glVertex2f(x-xx,y+yy); 72 | glVertex2f(x-yy,y+xx); 73 | glVertex2f(x+xx,y-yy); 74 | glVertex2f(x+yy,y-xx); 75 | glVertex2f(x-xx,y-yy); 76 | glVertex2f(x-yy,y-xx); 77 | } 78 | glEnd(); 79 | glFlush(); 80 | } 81 | 82 | void midpoint_ellipse(float x, float y) 83 | { 84 | int pk; 85 | int xx=0,yy=b; 86 | pk=b*b*(xx+1)*(xx+1)+a*a*(yy-0.5)*(yy+0.5)-a*a*b*b; 87 | glBegin(GL_POINTS); 88 | glColor3f(0.0,0.0,0.0); 89 | while((b*b*xx)<=(a*a*yy)) 90 | { 91 | if(pk<0) 92 | { 93 | //cout<<"here\n"; 94 | xx=xx+1;//0.001; 95 | pk=pk+2*b*b*(xx)+b*b; 96 | } 97 | else 98 | { 99 | //cout<<"there\n"; 100 | xx=xx+1; 101 | yy=yy-1; 102 | pk=pk+2*b*b*(xx)+b*b-2*a*a*(yy); 103 | } 104 | glVertex2f(x+xx,y+yy); 105 | glVertex2f(x-xx,y+yy); 106 | glVertex2f(x+xx,y-yy); 107 | glVertex2f(x-xx,y-yy); 108 | } 109 | //cout<0) 112 | { 113 | if(pk<=0) 114 | { 115 | xx=xx+1; 116 | yy=yy-1; 117 | pk=pk+2*b*b*(xx)+a*a-2*a*a*(yy); 118 | } 119 | else 120 | { 121 | yy=yy-1; 122 | pk=pk-2*a*a*(yy)+a*a; 123 | } 124 | glVertex2f(x+xx,y+yy); 125 | glVertex2f(x-xx,y+yy); 126 | glVertex2f(x+xx,y-yy); 127 | glVertex2f(x-xx,y-yy); 128 | } 129 | glEnd(); 130 | glFlush(); 131 | } 132 | 133 | void display(void) 134 | { 135 | glClear (GL_COLOR_BUFFER_BIT); 136 | p=0,q=0; 137 | glFlush (); 138 | } 139 | void disp1(void) 140 | { 141 | glClearColor(0.933, 0.510, 0.933, 0.0); 142 | glClear (GL_COLOR_BUFFER_BIT); 143 | polar_ellipse(p,q); 144 | RenderString(-750.0f, -800.0f, GLUT_BITMAP_TIMES_ROMAN_24, "Polar Ellipse"); 145 | glFlush (); 146 | } 147 | void disp2(void) 148 | { 149 | glClearColor(0.941, 0.902, 0.549, 0.0); 150 | glClear (GL_COLOR_BUFFER_BIT); 151 | polar_circle(p,q,400); 152 | RenderString(-750.0f, -800.0f, GLUT_BITMAP_TIMES_ROMAN_24, "Polar Circle"); 153 | glFlush (); 154 | } 155 | void disp3(void) 156 | { 157 | glClearColor(0.604, 0.804, 0.196, 0.0); 158 | glClear (GL_COLOR_BUFFER_BIT); 159 | midpoint_ellipse(p,q); 160 | RenderString(-750.0f, -800.0f, GLUT_BITMAP_TIMES_ROMAN_24, "Midpoint Ellipse"); 161 | glFlush (); 162 | } 163 | void disp4(void) 164 | { 165 | glClearColor(1.000, 0.894, 0.882, 0.0); 166 | glClear (GL_COLOR_BUFFER_BIT); 167 | midpoint_circle(p,q,400); 168 | RenderString(-750.0f, -800.0f, GLUT_BITMAP_TIMES_ROMAN_24, "Midpoint Cirlce"); 169 | glFlush (); 170 | } 171 | 172 | void init (void) 173 | { 174 | glClearColor(0.933, 0.510, 0.933, 0.0); 175 | } 176 | 177 | void myMouse(int button, int state, int x, int y) 178 | { 179 | float mx=float(x)/(700.0f)*(2000)-1000; 180 | float my=float(y)/(700.0f)*2000-1000; 181 | my=-my; 182 | //cin>>a>>b; 183 | } 184 | 185 | void keypr(unsigned char ch, int x, int y) 186 | { 187 | if(ch==32) 188 | { 189 | glutPostRedisplay(); 190 | } 191 | } 192 | 193 | int main(int argc, char** argv) 194 | { 195 | int win,w1,w2,w3,w4; 196 | glutInit(&argc, argv); 197 | glutInitDisplayMode (GLUT_SINGLE | GLUT_RGB); 198 | glutInitWindowSize (700, 700); 199 | glutInitWindowPosition (300, 300); 200 | win=glutCreateWindow ("R134214067"); 201 | glMatrixMode(GL_PROJECTION); 202 | glLoadIdentity(); 203 | gluOrtho2D(-1000, 1000,-1000, 1000); 204 | glutDisplayFunc(display); 205 | init (); 206 | w1=glutCreateSubWindow(win, 0 , 0, 350, 350); 207 | gluOrtho2D(-1000, 1000,-1000, 1000); 208 | glutDisplayFunc(disp1); 209 | w2=glutCreateSubWindow(win, 0, 350, 350, 350); 210 | gluOrtho2D(-1000, 1000,-1000, 1000); 211 | glutDisplayFunc(disp2); 212 | w3=glutCreateSubWindow(win, 350, 0, 350, 350); 213 | gluOrtho2D(-1000, 1000,-1000, 1000); 214 | glutDisplayFunc(disp3); 215 | w4=glutCreateSubWindow(win, 350, 350, 350, 350); 216 | gluOrtho2D(-1000, 1000,-1000, 1000); 217 | glutDisplayFunc(disp4); 218 | glutMouseFunc(myMouse); 219 | glutKeyboardFunc(keypr); 220 | glutMainLoop(); 221 | return 0; 222 | } -------------------------------------------------------------------------------- /Simran_500039296_6.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | using namespace std; 7 | //.... Setting Global Variables to be visible by all functions .... 8 | int count=0, x1=0, y1=0, y2=0, x2=0; 9 | bool flag=true; 10 | 11 | int cohen_xmin, cohen_xmax, cohen_ymin, cohen_ymax; 12 | int code(float x,float y) 13 | { 14 | int c=0; 15 | if(y>cohen_ymax)c=8; 16 | if(ycohen_xmax)c=c|2; 18 | if(x500) 90 | { 91 | x1=500; 92 | y1=y2-(m*(x2-x1)); 93 | } 94 | if(x2>500) 95 | { 96 | x2=500; 97 | y2=(m*(x2-x1))+y1; 98 | } 99 | if(y1>300) 100 | { 101 | y1=300; 102 | x1=x2-((1/m)*(y2-y1)); 103 | } 104 | if(y2>300) 105 | { 106 | y2=300; 107 | x2=((1/m)*(y2-y1))+x1; 108 | } 109 | 110 | glBegin(GL_LINES);//Drawing clipped Line 111 | glColor3f(0.2,0.2,0.8); 112 | glVertex2f(x1,y1); 113 | glVertex2f(x2,y2); 114 | glEnd(); 115 | glFinish(); 116 | 117 | 118 | //Liang Barsky 119 | float xmin=100, ymin=350, xmax=500, ymax=550, t1=0, t2=1, p[4], q[4], temp; 120 | p[0]=x_1-x_2; 121 | p[1]=x_2-x_1; 122 | p[2]=y_1-y_2; 123 | p[3]=y_2-y_1; 124 | q[0]=x_1-xmin; 125 | q[1]=xmax-x_1; 126 | q[2]=y_1-ymin; 127 | q[3]=ymax-y_1; 128 | 129 | for (int i=0; i<4; i++) 130 | { 131 | if ((p[i]==0)&&(q[i]<0)) 132 | ScreenClear(); 133 | 134 | } 135 | 136 | for (int i=0; i<4; i++) 137 | { 138 | temp=q[i]/p[i]; 139 | if(p[i]<0) 140 | { 141 | if(t1<=temp) 142 | t1=temp; 143 | } 144 | else 145 | { 146 | if(t2>temp) 147 | t2=temp; 148 | } 149 | } 150 | if(t1 2 | #include 3 | #include 4 | #include 5 | #include 6 | #define PI 3.14159265 7 | 8 | using namespace std; 9 | float OriginalTriangle [3][3]={{0,50,0},{50,50,25},{1,1,1}}; 10 | float ModifiedTriangle [3][3]={}; 11 | static float tx=0, ty=0, theta=0, sx=0, sy=0; 12 | void display() 13 | { 14 | const char *str2="Simran Aggarwal"; 15 | int j = strlen( str2 ); 16 | glColor3f( 0.9, 0.5, 1.0 ); 17 | glRasterPos2f(-280, 280 ); 18 | for( int i = 0; i < j; i++ ) 19 | { 20 | glutBitmapCharacter( GLUT_BITMAP_TIMES_ROMAN_24, str2[i] ); 21 | } 22 | glFlush(); 23 | } 24 | 25 | void drawTriangle(float Tri[3][3]) 26 | { 27 | glClear(GL_COLOR_BUFFER_BIT);//Clearing Screen 28 | glClearColor(0.0f, 0.0f, 0.0f, 0.8f); 29 | glBegin(GL_POLYGON); 30 | glColor3f(0.722, 0.525, 0.043); 31 | glVertex2f(Tri[0][0],Tri[1][0]);//Matrix position 32 | glVertex2f(Tri[0][1],Tri[1][1]); 33 | glVertex2f(Tri[0][2],Tri[1][2]); 34 | glEnd(); 35 | glFinish(); 36 | 37 | const char *str2="Simran Aggarwal"; 38 | int j = strlen( str2 ); 39 | glColor3f( 0.9, 0.5, 1.0 ); 40 | glRasterPos2f(-280, 280 ); 41 | for( int i = 0; i < j; i++ ) 42 | { 43 | glutBitmapCharacter( GLUT_BITMAP_TIMES_ROMAN_24, str2[i] ); 44 | } 45 | glFlush(); 46 | } 47 | 48 | 49 | void orignal() 50 | { 51 | sx=0;sy=0;tx=0;ty=0; 52 | drawTriangle(OriginalTriangle); 53 | 54 | } 55 | 56 | void modify(float a[3][3], float b[3][3], float c[3][3]) 57 | { 58 | for(int i=0;i<3;i++) 59 | { 60 | for(int j=0;j<3;j++) 61 | { 62 | c[i][j]=0; 63 | } 64 | } 65 | for (int i=0;i<3;i++) 66 | { 67 | for(int j=0;j<3;j++) 68 | { 69 | float sum=0; 70 | for (int k=0;k<3;k++) 71 | { 72 | sum=sum+(b[i][k]*a[k][j]); 73 | } 74 | c[i][j]=sum; 75 | } 76 | } 77 | for(int i=0;i<3;i++) 78 | { 79 | for(int j=0;j<3;j++) 80 | { 81 | OriginalTriangle[i][j]=c[i][j]; 82 | } 83 | } 84 | drawTriangle(OriginalTriangle); 85 | } 86 | 87 | void showOption() 88 | { 89 | cout<<"Choose the transformation:"; 90 | cout<<"\t\n.Translation: a,w,s,d"; 91 | cout<<"\t\n.Rotation: SPACEBAR"; 92 | cout<<"\t\n.Scaling: z"; 93 | cout<<"\t\n.Reflection: x, y"; 94 | cout<<"\t\n.Orignal: o"; 95 | } 96 | 97 | void myKey(unsigned char key, int x, int y) 98 | { 99 | 100 | if (key==97) 101 | { 102 | float b[3][3]={{1,0,-1},{0,1,0},{0,0,1}}; 103 | modify(OriginalTriangle, b, ModifiedTriangle); 104 | } 105 | else 106 | if (key==119)//move up with 'w' 107 | { 108 | float b[3][3]={{1,0,0},{0,1,1},{0,0,1}}; 109 | modify(OriginalTriangle, b, ModifiedTriangle); 110 | } 111 | else 112 | if (key==100)//move right with 'd' 113 | { 114 | float b[3][3]={{1,0,1},{0,1,0},{0,0,1}}; 115 | modify(OriginalTriangle, b, ModifiedTriangle); 116 | } 117 | else 118 | if (key==115)//move down with 's' 119 | { 120 | float b[3][3]={{1,0,0},{0,1,-1},{0,0,1}}; 121 | modify(OriginalTriangle, b, ModifiedTriangle); 122 | } 123 | else 124 | if(key==111)//show orignal with 'o' 125 | orignal(); 126 | if(key==122) //zoom z 127 | { 128 | float b[3][3]={{2,0,0},{0,2,0},{0,0,1}}; 129 | modify(OriginalTriangle, b, ModifiedTriangle); 130 | } 131 | else 132 | if(key==113) 133 | { 134 | float b[3][3]={{0.5,0,0},{0,0.5,0},{0,0,1}}; 135 | modify(OriginalTriangle, b, ModifiedTriangle); 136 | } 137 | else 138 | if(key==32)//rotate 90 degrees with 'space' 139 | { 140 | float b[3][3]={{cos(3.14/2), sin(3.14/2), 0},{-sin(3.14/2), cos(3.14/2),0},{0,0,1}}; 141 | modify(OriginalTriangle, b, ModifiedTriangle); 142 | } 143 | else if(key==120) 144 | { 145 | float b[3][3]={{1,0,0},{0,-1,0},{0,0,1}}; 146 | modify(OriginalTriangle, b, ModifiedTriangle); 147 | } 148 | else if(key==121) 149 | { 150 | float b[3][3]={{-1,0,0},{0,1,0},{0,0,1}}; 151 | modify(OriginalTriangle, b, ModifiedTriangle); 152 | } 153 | } 154 | 155 | 156 | int main(int argc, char** argv) 157 | { 158 | showOption(); 159 | glutInit(&argc, argv); 160 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 161 | glutInitWindowPosition(80, 80); 162 | glutInitWindowSize(600, 600); 163 | glutCreateWindow("Transformation"); 164 | glMatrixMode(GL_PROJECTION); 165 | glLoadIdentity(); 166 | gluOrtho2D(-300,300,300,-300); 167 | glutDisplayFunc(display); 168 | glutKeyboardFunc(myKey); 169 | glutMainLoop(); 170 | } -------------------------------------------------------------------------------- /Simran_500039296_8.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #define PI 3.14159265 7 | 8 | using namespace std; 9 | float orignal_cube[8][4]={{-20,20,20,1},{20,20,20,1},{20,20,-20,1},{-20,20,-20,1},{-50,-50,50,1},{50,-50,50,1},{50,-50,-50,1},{-50,-50,-50,1}}; 10 | float tx=0, ty=0, tz=0; 11 | float Sx = 0, Sy=0, Sz; 12 | float qx,qy,qz; 13 | 14 | void Draw(float Cube[8][4]) 15 | { 16 | glClear(GL_COLOR_BUFFER_BIT);//clearing Screen 17 | 18 | glBegin(GL_QUADS); 19 | 20 | glColor3f(1.0, 0.627, 0.478); 21 | glVertex3f(Cube[3][0],Cube[3][1],Cube[3][2]);//back surface 22 | glVertex3f(Cube[2][0],Cube[2][1],Cube[2][2]); 23 | glVertex3f(Cube[6][0],Cube[6][1],Cube[6][2]); 24 | glVertex3f(Cube[7][0],Cube[7][1],Cube[7][2]); 25 | 26 | glColor3f(0.576, 0.439, 0.859); 27 | glVertex3f(Cube[4][0],Cube[4][1],Cube[4][2]);//bottom surface 28 | glVertex3f(Cube[5][0],Cube[5][1],Cube[5][2]); 29 | glVertex3f(Cube[6][0],Cube[6][1],Cube[6][2]); 30 | glVertex3f(Cube[7][0],Cube[7][1],Cube[7][2]); 31 | 32 | glColor3f(0.0, 0.980, 0.604); 33 | glVertex3f(Cube[0][0],Cube[0][1],Cube[0][2]);//left surface 34 | glVertex3f(Cube[4][0],Cube[4][1],Cube[4][2]); 35 | glVertex3f(Cube[7][0],Cube[7][1],Cube[7][2]); 36 | glVertex3f(Cube[3][0],Cube[3][1],Cube[3][2]); 37 | 38 | glColor3f(1.0, 0.627, 0.478); 39 | glVertex3f(Cube[0][0],Cube[0][1],Cube[0][2]);//front surface 40 | glVertex3f(Cube[1][0],Cube[1][1],Cube[1][2]); 41 | glVertex3f(Cube[5][0],Cube[5][1],Cube[5][2]); 42 | glVertex3f(Cube[4][0],Cube[4][1],Cube[4][2]); 43 | 44 | glColor3f(0.576, 0.439, 0.859); 45 | glVertex3f(Cube[0][0],Cube[0][1],Cube[0][2]);//top surface 46 | glVertex3f(Cube[1][0],Cube[1][1],Cube[1][2]); 47 | glVertex3f(Cube[2][0],Cube[2][1],Cube[2][2]); 48 | glVertex3f(Cube[3][0],Cube[3][1],Cube[3][2]); 49 | 50 | glColor3f(0.0, 0.980, 0.604); 51 | glVertex3f(Cube[1][0],Cube[1][1],Cube[1][2]);//right surface 52 | glVertex3f(Cube[5][0],Cube[5][1],Cube[5][2]); 53 | glVertex3f(Cube[6][0],Cube[6][1],Cube[6][2]); 54 | glVertex3f(Cube[2][0],Cube[2][1],Cube[2][2]); 55 | 56 | glEnd(); 57 | glFlush(); 58 | } 59 | 60 | void display() 61 | { 62 | const char *str2="Simran Aggarwal"; 63 | int j = strlen( str2 ); 64 | glColor3f( 0.9, 0.5, 1.0 ); 65 | glRasterPos2f(-280, 280 ); 66 | for( int i = 0; i < j; i++ ) 67 | { 68 | glutBitmapCharacter( GLUT_BITMAP_TIMES_ROMAN_24, str2[i] ); 69 | } 70 | Draw(orignal_cube); 71 | glFlush(); 72 | 73 | } 74 | 75 | void mul(float a[][4], float b[][4], float c[][4]) 76 | { 77 | int i,j,k; 78 | float sum; 79 | for (i = 0; i <1; i++) { 80 | for (j = 0; j < 4; j++) { 81 | sum = 0; 82 | for (k = 0; k < 4; k++) { 83 | sum = sum + a[i][k] * b[k][j]; 84 | } 85 | c[i][j] = sum; 86 | } 87 | } 88 | } 89 | 90 | void modify(float mul_matrix[][4]) 91 | { 92 | float resultant_matrix[][4] = {{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0},{0,0,0,0}}; 93 | for(int i = 0; i< 8; i++) 94 | mul(orignal_cube+i,mul_matrix,resultant_matrix+i); 95 | Draw(resultant_matrix); 96 | for(int i = 0; i< 8; i++){ 97 | for(int j=0;j<4;j++){ 98 | orignal_cube[i][j] = resultant_matrix[i][j]; 99 | } 100 | } 101 | } 102 | 103 | void showOption() 104 | { 105 | cout<<"Choose the transformation:"; 106 | cout<<"\t\n.Translation: a,w,s,d"; 107 | cout<<"\t\n.Rotation: SPACEBAR"; 108 | cout<<"\t\n.Scaling: z"; 109 | cout<<"\t\n.Reflection: x, y"; 110 | cout<<"\t\n.Orignal: o"; 111 | } 112 | 113 | void myKey(unsigned char key, int x, int y) 114 | { 115 | if (key==97) 116 | { 117 | tx = tx - 20; 118 | float mulmatrix[][4] = {{1,0,0,0},{0,1,0,0},{0,0,1,0},{tx,ty,tz,1}}; 119 | modify(mulmatrix); 120 | tx = 0; 121 | } 122 | else 123 | if (key==119)//move up with 'w' 124 | { 125 | ty = ty + 20; 126 | float mulmatrix[][4] = {{1,0,0,0},{0,1,0,0},{0,0,1,0},{tx,ty,tz,1}}; 127 | modify(mulmatrix); 128 | ty = 0; 129 | } 130 | else 131 | if (key==100)//move right with 'd' 132 | { 133 | tx = tx + 20; 134 | float mulmatrix[][4] = {{1,0,0,0},{0,1,0,0},{0,0,1,0},{tx,ty,tz,1}}; 135 | modify(mulmatrix); 136 | tx = 0; 137 | } 138 | else 139 | if (key==115)//move down with 's' 140 | { 141 | ty = ty-20; 142 | float mulmatrix[][4] = {{1,0,0,0},{0,1,0,0},{0,0,1,0},{tx,ty,tz,1}}; 143 | modify(mulmatrix); 144 | ty = 0; 145 | } 146 | else 147 | if(key==122) //zoom z 148 | { 149 | Sx = 2; Sy = 2; Sz = 2; 150 | float mulmatrix[][4] = {{Sx,0,0,0},{0,Sy,0,0},{0,0,Sz,0},{0,0,0,1}}; 151 | modify(mulmatrix); 152 | Sx = 0; Sy = 0; Sz = 0; 153 | } 154 | else 155 | if(key==113) 156 | { 157 | Sx = 0.5; Sy = 0.5; Sz = 0.5; 158 | float mulmatrix[][4] = {{Sx,0,0,0},{0,Sy,0,0},{0,0,Sz,0},{0,0,0,1}}; 159 | modify(mulmatrix); 160 | Sx = 0; Sy = 0; Sz = 0; 161 | } 162 | else 163 | if(key == 'x') 164 | { 165 | qx = 30*3.14/180; 166 | float mulmatrix[][4] = {{1,0,0,0},{0,cos(qx),-sin(qx),0},{0,sin(qx),cos(qx),0},{0,0,0,1}}; 167 | modify(mulmatrix); 168 | qx =0; 169 | } 170 | else 171 | if(key == 'y') 172 | { 173 | qy = 30*3.14/180; 174 | float mulmatrix[][4] = {{cos(qy),0,sin(qy),0},{0,1,0,0},{-sin(qy),0,cos(qy),0},{0,0,0,1}}; 175 | modify(mulmatrix); 176 | qy=0; 177 | } 178 | else 179 | if(key == 'p') 180 | { 181 | qz = 30*3.14/180; 182 | float mulmatrix[][4] = {{cos(qz),-sin(qz),0,0},{sin(qz),cos(qz),0,0},{0,0,1,0},{0,0,0,1}}; 183 | modify(mulmatrix); 184 | qz=0; 185 | } 186 | } 187 | 188 | int main(int argc, char** argv) 189 | { 190 | glutInit(&argc, argv); 191 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 192 | glutInitWindowPosition(80, 80); 193 | glutInitWindowSize(600, 600); 194 | glutCreateWindow("3D"); 195 | glMatrixMode(GL_PROJECTION); 196 | glLoadIdentity(); 197 | glOrtho(-300,300,-300,300,300,-300); 198 | gluLookAt(3.0, 4.0, 5.0,0.0, 0.0, 0.0,0.0, 1.0, 0.); 199 | glutDisplayFunc(display); 200 | glutKeyboardFunc(myKey); 201 | glutMainLoop(); 202 | } -------------------------------------------------------------------------------- /license.txt: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /project.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | using namespace std; 10 | 11 | static float Xvalue = 0.0, Yvalue = 0.0, Angle = 0.0; 12 | 13 | 14 | int MoveMerc = 0; 15 | int MoveVen = 0; 16 | int MoveEar = 0; 17 | int MoveMars = 0; 18 | int MoveJup = 0; 19 | int MoveSat = 0; 20 | int MoveUra = 0; 21 | int MoveNept = 0; 22 | 23 | void myInit(void) { 24 | glClearColor (0.0, 0.0, 0.0, 0.0); 25 | } 26 | 27 | static float Merc[360][2]; 28 | static float Ven[360][2]; 29 | static float Ear[360][2]; 30 | static float Mars[360][2]; 31 | static float Jup[360][2]; 32 | static float Sat[360][2]; 33 | static float Ura[360][2]; 34 | static float Nept[360][2]; 35 | 36 | void generateCircle() 37 | { 38 | int i = 0; 39 | for(i=0; i <= 360; i++) 40 | { 41 | Merc[i][0] = sin(i*3.1416/180)*1; 42 | Merc[i][1] = cos(i*3.1416/180)*1; 43 | } 44 | 45 | for(i=0; i <= 360; i++) 46 | { 47 | Ven[i][0] = sin(i*3.1416/180)*1.5; 48 | Ven[i][1] = cos(i*3.1416/180)*1.5; 49 | } 50 | 51 | for(i=0; i <= 360; i++) 52 | { 53 | Ear[i][0] = sin(i*3.1416/180)*2.0; 54 | Ear[i][1] = cos(i*3.1416/180)*2.0; 55 | } 56 | for(i=0; i <= 360; i++) 57 | { 58 | Mars[i][0] = sin(i*3.1416/180)*2.5; 59 | Mars[i][1] = cos(i*3.1416/180)*2.5; 60 | } 61 | for(i=0; i <= 360; i++) 62 | { 63 | Jup[i][0] = sin(i*3.1416/180)*3.4; 64 | Jup[i][1] = cos(i*3.1416/180)*3.4; 65 | } 66 | for(i=0; i <= 360; i++) 67 | { 68 | Sat[i][0] = sin(i*3.1416/180)*4.3; 69 | Sat[i][1] = cos(i*3.1416/180)*4.3; 70 | } 71 | for(i=0; i <= 360; i++) 72 | { 73 | Ura[i][0] = sin(i*3.1416/180)*5.0; 74 | Ura[i][1] = cos(i*3.1416/180)*5.0; 75 | } 76 | for(i=0; i <= 360; i++) 77 | { 78 | Nept[i][0] = sin(i*3.1416/180)*5.8; 79 | Nept[i][1] = cos(i*3.1416/180)*5.8; 80 | } 81 | 82 | } 83 | 84 | void myDisplay(void) { 85 | 86 | glClear (GL_COLOR_BUFFER_BIT); 87 | glColor3f (1.0, 1.0, 1.0); 88 | 89 | //sun 90 | glPushMatrix(); 91 | glColor3f(1.000, 1.000, 0.000); 92 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 93 | glTranslatef(Xvalue, 0.0, Yvalue); 94 | glRotatef(Angle, 0.0, 0.0, 1.0); 95 | glutWireSphere (0.7, 15, 15); 96 | glPopMatrix(); 97 | 98 | //Mercury 99 | glPushMatrix(); 100 | glColor3f (0.55, 0.55, 0.55); 101 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 102 | if(MoveMerc==360) 103 | MoveMerc = 0; 104 | glTranslatef(Merc[MoveMerc][1], Merc[MoveMerc][0], 0.0); 105 | glRotatef(Angle, 0.0, 0.0, 1.0); 106 | glutWireSphere (0.2, 15, 15); 107 | glPopMatrix(); 108 | 109 | //Venus 110 | glPushMatrix(); 111 | glColor3f (0.604, 0.804, 0.196); 112 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 113 | if(MoveVen==360) 114 | MoveVen = 0; 115 | glTranslatef(Ven[MoveVen][1], Ven[MoveVen][0], 0.0); 116 | glRotatef(Angle, 0.0, 0.0, 1.0); 117 | glutWireSphere (0.2, 15, 15); 118 | glPopMatrix(); 119 | 120 | //Earth 121 | glPushMatrix(); 122 | glColor3f (0.275, 0.510, 0.706); 123 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 124 | if(MoveEar==360) 125 | MoveEar = 0; 126 | glTranslatef(Ear[MoveEar][1], Ear[MoveEar][0], 0.0); 127 | glRotatef(Angle, 0.0, 0.0, 1.0); 128 | glutWireSphere (0.4, 15, 15); 129 | glPopMatrix(); 130 | 131 | //Mars 132 | glPushMatrix(); 133 | glColor3f (1.0, 0.0, 0.0); 134 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 135 | if(MoveMars==360) 136 | MoveMars = 0; 137 | glTranslatef(Mars[MoveMars][1], Mars[MoveMars][0], 0.0); 138 | glRotatef(Angle, 0.0, 0.0, 1.0); 139 | glutWireSphere (0.3, 15, 15); 140 | glPopMatrix(); 141 | 142 | //Jupiter 143 | glPushMatrix(); 144 | glColor3f (1.000, 0.647, 0.000); 145 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 146 | if(MoveJup==360) 147 | MoveJup = 0; 148 | glTranslatef(Jup[MoveJup][1], Jup[MoveJup][0], 0.0); 149 | glRotatef(Angle, 0.0, 0.0, 1.0); 150 | glutWireSphere (0.6, 15, 15); 151 | glPopMatrix(); 152 | 153 | //Saturn 154 | glPushMatrix(); 155 | glColor3f (1.000, 0.871, 0.678); 156 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 157 | if(MoveSat==360) 158 | MoveSat = 0; 159 | glTranslatef(Sat[MoveSat][1], Sat[MoveSat][0], 0.0); 160 | glRotatef(Angle, 0.0, 0.0, 1.0); 161 | glutWireSphere (0.4, 15, 15); 162 | int i = 0; 163 | glBegin(GL_QUAD_STRIP); 164 | for(i=0; i <= 360; i++) 165 | { 166 | glVertex3f(sin(i*3.1416/180)*0.5, cos(i*3.1416/180)*0.5, 0 ); 167 | glVertex3f(sin(i*3.1416/180)*0.7, cos(i*3.1416/180)*0.7, 0 ); 168 | } 169 | glEnd(); 170 | glRotatef(Angle, 0.0, 0.0, 1.0); 171 | glPopMatrix(); 172 | 173 | //Uranus 174 | glPushMatrix(); 175 | glColor3f (0.000, 0.000, 0.545); 176 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 177 | if(MoveUra==360) 178 | MoveUra = 0; 179 | glTranslatef(Ura[MoveUra][1], Ura[MoveUra][0], 0.0); 180 | glRotatef(Angle, 0.0, 0.0, 1.0); 181 | glutWireSphere (0.4, 15, 15); 182 | glPopMatrix(); 183 | 184 | //Neptune 185 | glPushMatrix(); 186 | glColor3f (0.255, 0.412, 0.882); 187 | gluLookAt (0.0, 10.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 1.0); 188 | if(MoveNept==360) 189 | MoveNept = 0; 190 | glTranslatef(Nept[MoveNept][1], Nept[MoveNept][0], 0.0); 191 | glRotatef(Angle, 0.0, 0.0, 1.0); 192 | glutWireSphere (0.4, 15, 15); 193 | i = 0; 194 | glBegin(GL_QUAD_STRIP); 195 | for(i=0; i <= 360; i++) 196 | { 197 | glVertex3f(sin(i*3.1416/180)*0.5, cos(i*3.1416/180)*0.5, 0 ); 198 | glVertex3f(sin(i*3.1416/180)*0.7, cos(i*3.1416/180)*0.7, 0 ); 199 | } 200 | glEnd(); 201 | glRotatef(Angle, 0.0, 0.0, 1.0); 202 | glPopMatrix(); 203 | 204 | glFlush (); 205 | } 206 | 207 | void resize(int w, int h) 208 | { 209 | glViewport (0, 0, (GLsizei) w, (GLsizei) h); 210 | glMatrixMode (GL_PROJECTION); 211 | glLoadIdentity (); 212 | glFrustum (-1.0, 1.0, -1.0, 1.0, 1.5, 20.0); 213 | glMatrixMode (GL_MODELVIEW); 214 | glLoadIdentity (); 215 | } 216 | 217 | void animation(int value) 218 | { 219 | Angle += 15.0; 220 | glutPostRedisplay(); 221 | MoveMerc +=1; 222 | MoveVen +=1*2; 223 | MoveEar +=1*3; 224 | MoveMars +=1; 225 | MoveJup +=1*2; 226 | MoveSat +=1; 227 | MoveUra +=1*3; 228 | MoveNept +=1*2; 229 | glutPostRedisplay(); 230 | glutTimerFunc(100, animation, 0); 231 | } 232 | 233 | 234 | int main(int argc, char ** argv) 235 | { 236 | glutInit(&argc, argv); 237 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 238 | glutInitWindowSize(1024, 768); 239 | glutInitWindowPosition(100, 150); 240 | glutCreateWindow("Solar System"); 241 | myInit(); 242 | glutDisplayFunc(myDisplay); 243 | glutReshapeFunc(resize); 244 | generateCircle(); 245 | glutTimerFunc(100, animation, 0); 246 | glutMainLoop(); 247 | } 248 | 249 | 250 | 251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | 267 | 268 | 269 | -------------------------------------------------------------------------------- /readme.txt: -------------------------------------------------------------------------------- 1 | OpenGL Lab Experiments as a part of the curriculum along with a mini project 2 | 3 | Experiment 1: Draw a colored triangle. 4 | Experiment 2: Draw two triangles on same window, one colored and other multicolored. 5 | Experiment 3: Draw a hut and change the color of circle on mouse click. 6 | Experiment 4: Draw lines using DDA and Bresenham's algorithm. On clicking B 7 | bresenham's should be implemented and on clicking D DDA should 8 | be implemented. Space key is used to clear the screen. 9 | Experiment 5: Draw circle and ellipse using polar and mid-point algorithms. Show the output 10 | in different subwindows. 11 | Experiment 6: Implement line clipping using Cohen-Sutherland and Liang-Barsky 12 | Experiment 7: 2D Transformations 13 | Experiment 8: 3D Transformations 14 | seirpinski: A 3D Fractal with scaling and rotation features. 15 | 16 | project.cpp: A mini project on "Solar System" depicting 3D rotation and revolution of all planets. 17 | 18 | License 19 | This project is licensed under the GNU GENERAL PUBLIC LICENSE - see the LICENSE.txt file for details -------------------------------------------------------------------------------- /seirpinski.cpp: -------------------------------------------------------------------------------- 1 | //seirpinski 2 | #include 3 | #include 4 | #include 5 | #include 6 | #define GLfloat float 7 | 8 | using namespace std; 9 | GLfloat v[4][3]={{0.0,0.0,1.0},{0.0,1.0,0.0}, 10 | {-1.0,-0.5,0.0}, {1.0,-0.5,0.0}}; 11 | GLfloat colors[4][3]={{1.0,0.0,0.0},{0.0,1.0,0.0},{0.0,0.0,1.0},{0.0,0.0,0.0}}; 12 | int n; 13 | int count=15, cnt=15; 14 | GLfloat xRot, yRot, zRot, scale; 15 | 16 | void animate(int value); 17 | void animation(int value); 18 | void Scale() 19 | { 20 | glScalef(scale, scale, scale); 21 | glRotatef(xRot, 1.0, 0.0, 0.0); 22 | glRotatef(yRot, 0.0, 1.0, 0.0); 23 | glRotatef(zRot, 0.0, 0.0, 1.0); 24 | } 25 | 26 | void triangle(GLfloat *va,GLfloat *vb,GLfloat *vc) 27 | { 28 | glVertex3fv(va); 29 | glVertex3fv(vb); 30 | glVertex3fv(vc); 31 | } 32 | 33 | void tetra(GLfloat *a,GLfloat *b,GLfloat *c,GLfloat *d) 34 | { 35 | glColor3fv(colors[0]); 36 | triangle( a, b, c); 37 | glColor3fv(colors[1]); 38 | triangle( a, c, d); 39 | glColor3fv(colors[2]); 40 | triangle( a, d, b); 41 | glColor3fv(colors[3]); 42 | triangle( b, d, c); 43 | } 44 | 45 | void divide_tetra(GLfloat *a,GLfloat *b,GLfloat *c,GLfloat *d,int m) 46 | { 47 | GLfloat mid[6][3]; 48 | int j; 49 | if(m>0) 50 | { 51 | for(j=0;j<3;j++) mid[0][j]=(a[j]+b[j])/2; 52 | for(j=0;j<3;j++) mid[1][j]=(a[j]+c[j])/2; 53 | for(j=0;j<3;j++) mid[2][j]=(a[j]+d[j])/2; 54 | for(j=0;j<3;j++) mid[3][j]=(b[j]+c[j])/2; 55 | for(j=0;j<3;j++) mid[4][j]=(c[j]+d[j])/2; 56 | for(j=0;j<3;j++) mid[5][j]=(b[j]+d[j])/2; 57 | divide_tetra(a,mid[0],mid[1],mid[2],m-1); 58 | divide_tetra(mid[0],b,mid[3],mid[5],m-1); 59 | divide_tetra(mid[1],mid[3],c,mid[4],m-1); 60 | divide_tetra(mid[2],mid[5],mid[4],d,m-1); 61 | } 62 | else 63 | tetra( a, b, c, d); 64 | } 65 | 66 | void display(void) 67 | { 68 | glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT); 69 | glBegin(GL_TRIANGLES); 70 | divide_tetra(v[0],v[1],v[2],v[3],n); 71 | glEnd(); 72 | glFlush(); 73 | } 74 | 75 | void myKey(unsigned char key, int x, int y) 76 | { 77 | if(key==65) 78 | { 79 | scale+=1.05; 80 | Scale(); 81 | glutPostRedisplay(); 82 | 83 | } 84 | if(key==83) 85 | { 86 | scale=0.5; 87 | Scale(); 88 | glutPostRedisplay(); 89 | } 90 | } 91 | 92 | void myReshape(int w,int h) 93 | { 94 | glViewport(0,0,w,h); 95 | glMatrixMode(GL_PROJECTION); 96 | glLoadIdentity(); 97 | glOrtho(-2.0,2.0,-2.0,2.0 ,-10.0,10.0); 98 | glMatrixMode(GL_MODELVIEW); 99 | glutPostRedisplay(); 100 | } 101 | 102 | void init() 103 | { 104 | glClear(GL_COLOR_BUFFER_BIT); 105 | xRot=yRot=zRot=0.0; 106 | scale=1.0; 107 | } 108 | void animation(int value) 109 | { 110 | if(count <=15 && count>0) 111 | { 112 | scale+=0.005; 113 | yRot+=0.1; 114 | cout<0) 131 | { 132 | scale-=0.01; 133 | yRot-=0.1; 134 | cout<