Scribd
Upload
110 views3 pages

Program To Recursively Subdivide A Tetrahedron To From 3D Sierpinski Gasket - The Number of Recursive Steps Is To Be Specified by The User

This program recursively subdivides a tetrahedron to generate a 3D Sierpinski gasket fractal. The user specifies the number of recursive subdivision steps. It contains functions to divide triangles by connecting the midpoints, draw triangles, and initialize the tetrahedron. The main function gets user input, sets up the OpenGL window, and calls the other functions to recursively subdivide and display the fractal tetrahedron.

Uploaded by

Dhyan Mohan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
110 views3 pages

Program To Recursively Subdivide A Tetrahedron To From 3D Sierpinski Gasket - The Number of Recursive Steps Is To Be Specified by The User

This program recursively subdivides a tetrahedron to generate a 3D Sierpinski gasket fractal. The user specifies the number of recursive subdivision steps. It contains functions to divide triangles by connecting the midpoints, draw triangles, and initialize the tetrahedron. The main function gets user input, sets up the OpenGL window, and calls the other functions to recursively subdivide and display the fractal tetrahedron.

Uploaded by

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

CG Lab Prgm-1

7. Program to recursively subdivide a tetrahedron to from 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, 0.0}, {0.0, 1.0, -1.0},{-1.0, -1.0, -1.0},{1.0,
-1.0, -1.0}};

int n;
void triangle(point a, point b, point c)
{
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;
if (m > 0)
{
for (int i = 0; i < 3; i++)
{
v1[i] = (a[i] + b[i]) / 2;
v2[i] = (a[i] + c[i]) / 2;
v3[i] = (b[i] + c[i]) / 2;
}
divide_triangle(a, v1, v2, m - 1);
divide_triangle(c, v2, v3, m - 1);
divide_triangle(b, v3, v1, m - 1);
}
else
{
triangle(a, b, c);
/* draw triangle at end of recursion */
}
}
void tetrahedron(int m)
{
glColor3f(1.0, 0.0, 0.0);
divide_triangle(v[0], v[1], v[2], m);
glColor3f(0.0, 1.0, 0.0);
divide_triangle(v[3], v[2], v[1], m);
glColor3f(0.0, 0.0, 1.0);
divide_triangle(v[0], v[3], v[1], m);
glColor3f(0.0, 0.0, 0.0);
CG Lab Prgm-1

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


}
void display()
{
glClearColor(1.0, 1.0, 1.0, 1.0);
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);
}
int main(int argc, char **argv)
{
printf("Enter number of recursive steps \n");
scanf("%d",&n);
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB | GLUT_DEPTH);
glutInitWindowSize(500,500);
glutInitWindowPosition(0, 0);
glutCreateWindow("3D Sierpinski Gasket");
glutFullScreen();
glutReshapeFunc(myReshape);
glutDisplayFunc(display);
glEnable(GL_DEPTH_TEST);
glutMainLoop();
}

OUTPUT:
CG Lab Prgm-1

You might also like