Scribd
Upload
17 views

CG LAB PROGRAM 3 and 4

Uploaded by

coxone5132
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views

CG LAB PROGRAM 3 and 4

Uploaded by

coxone5132
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

LAB PROGRAM - 3

3. Design, develop and implement recursively subdivide a tetrahedron to form 3D sierpinski


gasket. The number of recursive steps is to be specified by the user.

#include<stdlib.h>

#include<stdio.h>

#include<GL/glut.h>

typedef float point[3];

point v[]= {{0.0,0.0,1.0},

{0.0,0.942809,-0.33333},

{-0.816497,-0.471405,-0.333333},

{0.816497,-0.471405,-0.333333}

}; //vertices of tetrahedron

int n;

void triangle(point a, point b, point c) //to draw triangles

glBegin(GL_POLYGON);

glVertex3fv(a);

glVertex3fv(b);

glVertex3fv(c);

glEnd();

void divide_triangle(point a,point b,point c,int m)

{ point v1,v2,v3;

int j;

if(m>0) // triangle subdivision

for(j=0;j<3;j++)

v1[j]=(a[j]+b[j])/2; //find midpoint of side1

for (j=0;j<3;j++)

v2[j]=(a[j]+c[j])/2; //find midpoint of side2

for(j=0;j<3;j++)
v3[j]=(b[j]+c[j])/2; //find midpoint of side3

divide_triangle(a,v1,v2,m-1); // triangle

redivision ,

recursive

divide_triangle(c,v2,v3,m-1);

divide_triangle(b,v3,v1,m-1);

else (triangle (a,b,c));

void tetrahedron(int m) //tetrahedron division

glColor3f(0.9,0.1,0.2);

divide_triangle(v[0],v[1],v[2],m); //call for

triangular face-1

division

glColor3f(0.8,0.1,0.8);

divide_triangle(v[3],v[2],v[1],m); //call for

triangular face-2

division

glColor3f(0.2,0.1,0.9);

divide_triangle(v[0],v[3],v[1],m); //call for

triangular face-3

division

glColor3f(0.3,0.3,0.3);

divide_triangle(v[0],v[2],v[3],m); //call for

triangular face-4

division

void display(void)

glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);
glLoadIdentity();

tetrahedron(n);

glFlush();

void myReshape(int w,int h)

glViewport(0,0,w,h);

glMatrixMode(GL_PROJECTION);

glLoadIdentity();

if(w<=h)

glOrtho(-2.0,2.0, -2.0*(GLfloat)h/(GLfloat)w,

2.0*(GLfloat)h/(GLfloat)w,-10.0,10.0);

else

glOrtho(2.0*(GLfloat)w/(GLfloat)h,

2.0*(GLfloat)w/(GLfloat)h, -2.0,2.0,-10.0,10.0);

glMatrixMode(GL_MODELVIEW);

glutPostRedisplay();

int main(int argc, char **argv)

printf("\n Enter the number of division:\n");

fflush(stdout);

scanf("%d",&n);

glutInit(&argc,argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB|GLUT_DEPTH);

glutInitWindowSize(500,500);

glutInitWindowPosition(0,0);

glutCreateWindow("3D Gasket");

glutReshapeFunc(myReshape);

glutDisplayFunc(display);

glEnable(GL_DEPTH_TEST);
glClearColor(1.0,1.0,1.0,1.0);

glutMainLoop();

return 0;

Output:

Enter the number of divisions: 3

LAB PROGRAM - 4
4. Develop a OpenGL program to spin 3D sierpinski gasket using OpenGL transformation matrices.

#include<stdlib.h>

#include<stdio.h>

#include<GL/glut.h>

typedef float point[3];

point v[]= {{0.0,0.0,1.0},

{0.0,0.942809,-0.33333},

{-0.816497,-0.471405,-0.333333},

{0.816497,-0.471405,-0.333333}
}; //vertices of tetrahedron

int n;

void triangle(point a, point b, point c) //to draw triangles

glBegin(GL_POLYGON);

glVertex3fv(a);

glVertex3fv(b);

glVertex3fv(c);

glEnd();

void divide_triangle(point a,point b,point c,int m)

{ point v1,v2,v3;

int j;

if(m>0) // triangle subdivision

for(j=0;j<3;j++)

v1[j]=(a[j]+b[j])/2; //find midpoint of side1

for (j=0;j<3;j++)

v2[j]=(a[j]+c[j])/2; //find midpoint of side2

for(j=0;j<3;j++)

v3[j]=(b[j]+c[j])/2; //find midpoint of side3

divide_triangle(a,v1,v2,m-1); // triangle

redivision ,

recursive

divide_triangle(c,v2,v3,m-1);

divide_triangle(b,v3,v1,m-1);

else (triangle (a,b,c));

void tetrahedron(int m) //tetrahedron division

{
glColor3f(0.9,0.1,0.2);

divide_triangle(v[0],v[1],v[2],m); //call for

triangular face-1

division

glColor3f(0.8,0.1,0.8);

divide_triangle(v[3],v[2],v[1],m); //call for

triangular face-2

division

glColor3f(0.2,0.1,0.9);

divide_triangle(v[0],v[3],v[1],m); //call for

triangular face-3

division

glColor3f(0.3,0.3,0.3);

divide_triangle(v[0],v[2],v[3],m); //call for

triangular face-4

division

void display(void)

glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);

tetrahedron(n);

glRotatef(0.5,1.0,0.0,0.0);

glFlush();

void myReshape(int w,int h)

glViewport(0,0,w,h);

glMatrixMode(GL_PROJECTION);

glLoadIdentity();

if(w<=h)

glOrtho(-2.0,2.0, -2.0*(GLfloat)h/(GLfloat)w,
2.0*(GLfloat)h/(GLfloat)w,-10.0,10.0);

else

glOrtho(2.0*(GLfloat)w/(GLfloat)h,

2.0*(GLfloat)w/(GLfloat)h, -2.0,2.0,-10.0,10.0);

glMatrixMode(GL_MODELVIEW);

glutPostRedisplay();

int main(int argc, char **argv)

printf("\n Enter the number of division:\n");

fflush(stdout);

scanf("%d",&n);

glutInit(&argc,argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB|GLUT_DEPTH);

glutInitWindowSize(500,500);

glutInitWindowPosition(0,0);

glutCreateWindow("3D Gasket");

glutReshapeFunc(myReshape);

glutDisplayFunc(display);

glEnable(GL_DEPTH_TEST);

glClearColor(1.0,1.0,1.0,1.0);

glutIdleFunc(display);

glutMainLoop();

return 0;

Output:

Enter the number of divisions: 3

You might also like