Write a code to continuously rotate square about pivot point, Computer Graphics

Assignment Help:

Write a code to continuously rotate a square about a pivot point. 

  #include  

static GLfloat rotat=0.0;  

void init(void);

void display(void);

void reshape(int w, int h);

void rotate(void);  

int main()

{      

        glutInitDisplayMode(GLUT_RGB|GLUT_DOUBLE);

        glutInitWindowSize(500,500);

        glutInitWindowPosition(100,100);

        glutCreateWindow("Moving squares");

        init();

        glutDisplayFunc(display);

        glutReshapeFunc(reshape);

        glutIdleFunc(rotate);

        glutMainLoop();

}  

void init(void){ 

glClearColour(0.0,0.0,0.0,0.0);

}  

void display(void)

{  glClear(GL_COLOUR_BUFFER_BIT);

   glPushMatrix(); //Push the transformation matrix to stack 

   glTranslatef(-50.0f,-50.0f,0.0); 

   //Translate the pivot point to origin

   glRotatef(rotat,0.0,0.0,1.0); // Rotate about origin

   glTranslatef(50.0f,50.0f,0.0); 

   //Translate pivot point back to its position

   glColour3f(0.0,0.0,1.0); //Set colour of square

   glRectf(-50.0,-50.0,50.0,50.0); //Draw square 

   glPopMatrix(); //Pop the matrix from stack

   glutSwapBuffers(); // Swap buffers

}  

void reshape(int w, int h)

{        glViewport(0,0,(GLsizei)w,(GLsizei)h);

        glMatrixMode(GL_PROJECTION);

        glLoadIdentity();

        glOrtho(-250.0,250.0,-250.0,250.0,-1.0,1.0);

        glMatrixMode(GL_MODELVIEW);

        glLoadIdentity();

}  

void rotate(void)

{     rotat+=0.1; //Continuously increse the rotation angle by 0.1

                if(rotat>360.0)

                        rotat-=360.0;

        glutPostRedisplay(); //send the current window for

redisplay

}

 


Related Discussions:- Write a code to continuously rotate square about pivot point

Common transformation for parallel projection-transformation, Derive the co...

Derive the common transformation for parallel projection into a specified view plane, here the direction of projection d=aI+bJ+cK is along the normal N=n1I+n2J+n3K along with the r

Distinguish between bitblt and pixblt, Distinguish between bitBlt and pixBl...

Distinguish between bitBlt and pixBlt?  Raster functions that manipulate rectangular pixel arrays are usually referred to as raster ops. Moving a block of pixels from one locat

Z-buffer, describe z-buffer algorithm removing hidden surface

describe z-buffer algorithm removing hidden surface

Designing human Computer interface, I have an assignment to do & it''s due ...

I have an assignment to do & it''s due on Wednesday !

What is orthographic parallel projection, What is orthographic parallel pro...

What is orthographic parallel projection?  When the direction of the projection is normal (perpendicular) to the view plane then the projection is called as orthographic paral

Img- mac-msp file formats, IMG/MAC/MSP File Formats IMG files were orig...

IMG/MAC/MSP File Formats IMG files were originally implemented to work along with GEM paint program and can handle monochrome and grey level pictures only. MAC files are uti

Dissimilarity between the printer and the plotter, Dissimilarity between th...

Dissimilarity between the Printer and the Plotter 1)  Plotters print their output through moving a pen across the surface of paper's piece. It implies that plotters are lim

Reflection and shear - output primitives, Reflection and Shear There ar...

Reflection and Shear There are a few important transformations which are not primitive in the sense that they can be expressed as compositions of translation, rotation and scal

Implement cohen sutherland and liang barsky algorithm, Implement Cohen Suth...

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd