MCSL54 53 Computer Graphics

Mcsl 054 (53)
----Session 2----
Exercise 4:
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
void init()
{
glClearColor(0.0,0.0,0.0,0.0); // background Color
glColor3f(1.0,1.0,0.0);//Drawing Color
glPointSize(4);
o m
glMatrixMode(GL_PROJECTION);
glLoadIdentity();
o t.c
gluOrtho2D(0.0,800,0.0,600.0);
s p
}
void display()
lo g
{
e . b
it
glClear(GL_COLOR_BUFFER_BIT);
s
u
glBegin(GL_POLYGON);
n oglVertex2i(100,100);
i g glVertex2i(100,500);
glVertex2i(700,500);
glEnd();
glFlush();
}
void main(int argc, char **argv)
{
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);
glutInitWindowSize(800,600);
glutCreateWindow("Session2, Exer4(Niraj)");
glutDisplayFunc(display);
init();
www.Ignousite.blogspot.com (ignou study helper)

glutMainLoop();
}
Output:
Exercise 5:
o m
/*
o t .c
sp
* Problem definition: Yello rectange on black background
* By: Prasun Pal(prsn)
lo g
* Date: 21/04/2009
*/
e . b
s
#include<windows.h>
it
u
#include<gl/gl.h>
o
i g n
#include<gl/glu.h>
#include<gl/glut.h>
void init()
{
glClearColor(0.0,0.0,0.0,0.0); // background Color
glPointSize(4);
glLoadIdentity();
gluOrtho2D(0.0,800,0.0,600.0);
}
void display()
{

glEnd();
glFlush();
}
{
o m
init();
o t.c
glutMainLoop();
sp
}
Output:
lo g
e . b
s it
o u
i g n
Exercise 6:
/*
* Problem definition: just to draw basic primitives of OpenGl

* such as GL_INES, GL_QUAD, GL_TRIANGLES etc.
* Date: 21/04/2009
*/
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
void init()
{
glClearColor(1.0,1.0,1.0,0.0); //background Color
glPointSize(4);
o m
glLoadIdentity();
o t .c
gluOrtho2D(0.0,800,0.0,600.0);
sp
}
void display()
lo g
{
e . b
it
s
o u
glBegin(GL_LINES);
i g n glVertex2i(550,400);
glEnd();
glBegin(GL_QUADS);
glVertex2i(258,45);
glVertex2i(12,389);
glEnd();

glBegin(GL_TRIANGLES);
glEnd();
glFlush();
}
{
glutCreateWindow("Session2, Exer4(prsn)");
o m
init();
glutMainLoop();
o t.c
}
sp
Output:
lo g
e . b
s it
o u
i g n
----Session 3----

Exercise 7:
/*
* Problem definition:To impement DDA Line-generation algorithm
* Date: 21/04/2009
*/
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
#include<math.h>
void nkjSwap(float *,float *);
o m
void nkjInit()
{
o t .c
sp
glClearColor(1.0,1.0,1.0,0.0); //Black background Color
glPointSize(2);
lo g
glColor3f(0.0,0.0,0.0);//Drawing Color yellow
e . b
glLoadIdentity();
s it
}
o u
gluOrtho2D(0.0,800,0.0,600.0);
i g n
void nkjDDA4f(float x1, float y1, float x2, float y2)
{
if(x1>x2)
{
nkjSwap(&x1,&x2);
nkjSwap(&y1,&y2);
}
float slope=(y2-y1)/(float)(x2-x1);
if(slope>0 && slope<1)
{
while(x1<=x2)
{

glVertex2i((int)x1,int(y1));
x1++;
y1+=slope;
}
}
else if(slope>=1)
{
float slope1=1/slope;
while(y1<=y2)
{
glVertex2i(int(x1),int(y1));
y1++;
x1+=slope1;
}
o m
}
}
o t.c
sp
void nkjSwap(float *x, float *y)
{
lo g
float temp=*x;
e . b
*x=*y;
s it
}
*y=temp;
o u
i g n
void nkjDisplay()
{
glBegin(GL_POINTS);
nkjDDA4f(100.0,100.0,350.0,350.0);//two points
p1(100,100), p2(350,350)
glEnd();
glFlush();
}

{

glutDisplayFunc(nkjDisplay);
nkjInit();
glutMainLoop();
Output:
o m
o t.c
sp
lo g
e . b
s it
o u
i g n
Exercise 8:
/*

* Problem definition:To impement Bresenham Circle-generation
algorithm
* Date: 21/04/2009
*/
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
#include<math.h>
#include<stdio.h>
void nkjSwap(float *,float *);
o m
.c
void nkjInit()
{
o t
p
s
glPointSize(2);
lo g
. b
e
glLoadIdentity();
s it
gluOrtho2D(0.0,800,0.0,600.0);
}
o u
i g n
void nkjBresenhamCircleGeneration3f(float x1, float y1, float
radious)
{
float dcsnPrmtr=5/4-radious;//decision Parameter
int k=0;
float x=x1, y=y1;
x1=0;
y1=radious;
while(x1<y1)
{
if(dcsnPrmtr<0)
{
dcsnPrmtr += 2 * x1 + 2 + 1;

x1++;
}
else //if(dcsnPrmtr
{
dcsnPrmtr += 2 * x1 + 2 - 2 * y1 - 2 + 1;
x1++;
y1--;
}
//generate symmetry points
glVertex2i((int)(x+x1),(int)(y+y1));
glVertex2i((int)(x-x1),(int)(y+y1));
glVertex2i((int)(x+x1),(int)(y-y1));
glVertex2i((int)(x-x1),(int)(y-y1));
o m
glVertex2i((int)(x+y1),(int)(y+x1));
glVertex2i((int)(x-y1),(int)(y+x1));
o t .c
sp
glVertex2i((int)(x+y1),(int)(y-x1));
}
lo g
glVertex2i((int)(x-y1),(int)(y-x1));
}
e . b
void nkjDisplay()
s it
{
o u
i g n
glBegin(GL_POINTS);
nkjBresenhamCircleGeneration3f(400.0,300.0,150.0);
glEnd();
glFlush();
}
{
glutCreateWindow("Session2, Exer4(nkj)");
glutDisplayFunc(nkjDisplay);
nkjInit();
glutMainLoop();

}
Output:
o m
o t .c
sp
lo g
e . b
it
Exercise 9:
/*
u s
n o
* Problem definition:To draw a convex hall polygon
i g
* Date: 21/04/2009
*/
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
#include<math.h>
#include<stdio.h>
void prsnInit()

{
glPointSize(4);
glLoadIdentity();
gluOrtho2D(0.0,800,0.0,600.0);
}
void prsnConvexHallPolygon()
{
o m
o t.c
sp
lo g
e . b
s it
o u
i g n
void prsnDisplay()
{
glBegin(GL_LINES);
prsnConvexHallPolygon();
glEnd();

glFlush();
}

{
glutCreateWindow("Session2, Exer4(prsn)");
glutDisplayFunc(prsnDisplay);
prsnInit();
glutMainLoop();
}
o m
o t.c
Output:
sp
lo g
e . b
s it
o u
i g n

----Session 4----
Exercise 10:
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
m
#include<gl/glut.h>
#include<iostream.h>
.c o
void display();
o t
void myInit();
sp
void main(int i,char **ptr)
lo g
{
glutInit(&i, ptr);
e . b
s it
u
o
i g n
glutInitWindowPosition(100,100);
glutCreateWindow("OpenGL Window");
myInit();
glutMainLoop();
}
void myInit()
{
glClearColor(1.0,1.0,1.0,0.0);
glColor3f(0.0f,0.0f,0.0f);
glPointSize(4.0);
glLoadIdentity();
gluOrtho2D(0.0,800.0,0.0,800.0);

}
void display()
{
glBegin(GL_LINES);
o m
glEnd();
glFlush();
o t.c
}
sp
Output:
lo g
e . b
s it
o u
i g n
Exercise 11:

#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
void display();
void myInit();
{
glutInit(&i, ptr);
o m
myInit();
o t.c
glutMainLoop();
sp
}
lo g
void myInit()
e . b
{
s it
o u
i g n
glPointSize(4.0);
glLoadIdentity();
gluOrtho2D(0.0,800.0,0.0,800.0);
}
void display()
{
glLineWidth(4.0);
glBegin(GL_LINES);

glEnd();
glEnable(GL_LINE_STIPPLE);
glLineStipple(1,0xAAAA);
glBegin(GL_LINES);
o m
o t.c
sp
glEnd();
lo g
e .
glDisable(GL_LINE_STIPPLE);
b
s it
}
o u
glFlush();
i g n
Output:

o m
o t.c
sp
Exercise 12:
lo g
#include<windows.h>
e . b
#include<gl/gl.h>
s it
u
#include<gl/glu.h>
o
#include<gl/glut.h>
n
i g
void display();
void main(int argc, char *argv[])

{
glutCreateWindow("EX-12 GRAPHICS");
//init
glColor3f(1.0,1.0,0.0);
glPointSize(4);

glLoadIdentity();
gluOrtho2D(0.0,800.0,0.0,600.0);
glutMainLoop();
}
void display()
{
glColor3f(0.0,1.0,1.0);
glBegin(GL_LINES);
glVertex2i(40,210);
glVertex2i(40,210);
o m
glVertex2i(40,10);
o t.c
glVertex2i(240,10);
sp
glVertex2i(40,180);
lo g
e . b
s it
o u
i g n
glVertex2i(120,10);
glVertex2i(120,10);
glVertex2i(160,10);
glVertex2i(160,10);
glVertex2i(40,10);
glVertex2i(240,10);
glEnd();
glBegin(GL_QUADS);

glVertex2i(50,205);
glVertex2i(50,180);
glVertex2i(75,180);
glVertex2i(75,205);
glEnd();
glFlush();
}
o m
o t.c
sp
Output:
lo g
e . b
s it
o u
i g n

o m
o t.c
sp
g
----Session 5----
lo
Exercise 13:
e . b
s it
u
#include<windows.h>
o
i n
#include<gl/gl.h>
g
#include<gl/glu.h>
#include<gl/glut.h>
void display();
void myInit();
{
glutInit(&i, ptr);

myInit();
glutMainLoop();
}
void myInit()
{
glPointSize(4.0);
glLoadIdentity();
gluOrtho2D(0.0,800.0,0.0,800.0);
}
void display()
{
o m
int i=0,j=0;
o t .c
int scale=100;
s p
for(i=0;i<8;i++)
{
lo g
for(j=0;j<8;j++)
e . b
{
s it
o u if((i+j)%2==0)
{
i g n }
glColor3f(0.0,0.0,0.0);
else
{
glColor3f(1.0,1.0,1.0);
}
glVertex2i(j*scale,i*scale);
glVertex2i(j*scale,i*scale+scale);
glVertex2i(j*scale+scale,i*scale+scale);
glVertex2i(j*scale+scale,i*scale);
glEnd();
}
}

glFlush();
}
Output:
o m
o t.c
sp
Exercise 15:
lo g
#include<windows.h>
e . b
#include<gl/gl.h>
s it
u
#include<gl/glu.h>
o
#include<gl/glut.h>
n
i g
#include<stdio.h>
#include<math.h>
#include<stdarg.h>
//function that implements Sutherand-Cohen algorithm

void nkjImpementsSutherlandCohen(int [], int , ... );
//function to deside visibiity of any line
int nkjDecideVisibility(int [],int *,int *,int *,int *);
//function to generate bit code of points
int nkjGenerateCode(int,int, int, int, int ,int);
//to perform swapping
void nkjSwap(int * , int *);
void nkjInit()

{
glPointSize(4);
glLoadIdentity();
gluOrtho2D(0.0,200.0,0.0,200.0);
}
void nkjDisplayLines()
{
int points[]={110,110,10,10};// points for window position
int xMax,yMax,xMin,yMin;
xMax=yMax=110;
xMin=yMin=10;
o m
o t.c
//Drawing Window
sp
glBegin(GL_LINES);
glVertex2i(xMin,yMin);
lo g
e . b
glVertex2i(xMin,yMax);
s it
o u
glVertex2i(xMax,yMax);
i g n glVertex2i(xMax,yMax);
glVertex2i(xMax,yMin);
nkjImpementsSutherlandCohen(points,12,25,75,90,100,125,35,110,1
20,50,50,120,120);
glEnd();
glFlush();
}
void nkjImpementsSutherlandCohen(int polygonPoints[], int
vertexPoints, ... )

{
int x1, y1, x2,y2;
int ind, total, decision;
va_list ptr;
va_start(ptr, vertexPoints);
if(vertexPoints%4!=0)
{
printf("nkjError Message! Wrong number of arguments
given........\n");
return;
}
total=vertexPoints/4;
o m
.c
for(ind=0;ind<total;ind++)
{
o t
x1=va_arg(ptr,int);
sp
y1=va_arg(ptr,int);
x2=va_arg(ptr,int);
lo g
.
y2=va_arg(ptr,int);
e b
decision=
s it
nkjDecideVisibility(polygonPoints,&x1,&y1,&x2,&y2);
o u
if(decision!=-1)
i g n {
//this implies ine must be drawn and points are stored
//in the corresponding variables
glVertex2i(x1,y1);
glVertex2i(x2,y2);
}
}
}
int nkjDecideVisibility(int points[], int *x1,int *y1, int *x2, int

*y2)
{
int code1,code2;
xMax=points[0];

yMax=points[1];
xMin=points[2];
yMin=points[3];
for(;;)
{
code1=nkjGenerateCode(xMax,yMax,xMin,yMin,*x1,*y1);
if(code1==0 && code2==0)

{
//this indicates line is totaly visible
return 1;
}
else if((code1 & code2)!=0)
o m
{
o t
//this implies line is totaly invisible.c
return -1;
s p
}
else
lo g
{
e . b
s it
if(*x1>xMax)
o u {
//finding intersection of line[(x1,y1),(x2,y2)] and xMax
i g n *y1=(((*y2-*y1)/(*x2-*x1))*(xMax-*x1)) + *y1;
*x1=xMax;
}
else if(*x1<xMin)
{
//finding intersection of line[(x1,y1),(x2,y2)] and xMin
*y1=(((*y2-*y1)/(*x2-*x1))*(xMin-*x1)) + *y1;
*x1=xMin;
}
if(*y1>yMax)
{
//finding intersection of line[(x1,y1),(x2,y2)] and yMax
*x1=((yMax-*y1)*((*x2-*x1)/(*y2-*y1))) + *x1;

*y1=yMax;
}
else if(*y1<yMin)
{
//finding intersection of line[(x1,y1),(x2,y2)] and yMin
*x1=((yMin-*y1)*((*x2-*x1)/(*y2-*y1))) + *x1;
*y1=yMin;
}
}
//generating new code for the clipped points
if(code1==0)
{
o m
t .c
//interchange two points and respective flags
nkjSwap(x1,x2);
o
nkjSwap(y1,y2);
s p
}
nkjSwap(&code1,&code2);
lo g
}
e . b
it
return -1; //this will never execute, just to satisfy compiler
s
}
o u
i g n
int nkjGenerateCode(int xMax, int yMax, int xMin, int yMin, int x,
int y)
{
int code=0;
//code sequence UDLR
if(x>xMax)
code|=1;//0001 Right bit
else if(x<xMin)
code|=2;//0010 Left bit
if(y>yMax)
code|=8;//1000 Up/Top bit
else if(y<yMin)
code|=4;//0100 Down/Bottom nit

return code;
}
void nkjSwap(int *x, int *y)

{
*x=*x^*y;
*y=*x^*y;
*x=*x^*y;
}

{
glutInit(&argc,argv);
o m
o t.c
glutCreateWindow("Sutherland-Cohen by Prasun Pal");
glutDisplayFunc(nkjDisplayLines);
sp
nkjInit();
glutMainLoop();
lo g
}
e . b
s it
Output:
o u
i g n

----Session 6----
Exercise 16:
#include<windows.h>
#include<gl/gl.h>
#include<gl/glu.h>
#include<gl/glut.h>
#include<stdio.h>
#include<math.h>
#include<stdarg.h>
//function that implements Sutherand-Cohen algorithm

void nkjImpementsSutherlandCohen(int [], int , ... );
//function to deside visibiity of any line
o m
int nkjDecideVisibility(int [],int *,int *,int *,int *);
o t.c
p
//function to generate bit code of points
int nkjGenerateCode(int,int, int, int, int ,int);
g s
lo
//to perform swapping
void nkjSwap(int * , int *);
e . b
void nkjInit()
s it
{
o u
i g n
glPointSize(4);
glLoadIdentity();
gluOrtho2D(0.0,200.0,0.0,200.0);
}
void nkjDisplayLines()
{
int points[]={60,40,20,20};// points for window position xMax, yMax,
// xMin, yMin
xMax=60;

yMax=40;
xMin=yMin=20;
//Drawing Window
glBegin(GL_LINES);
o m
o t.c
sp
//Total 4 points two for p and two for q
lo g
nkjImpementsSutherlandCohen(points,4,40,80,120,30);
glEnd();
e . b
}
glFlush();
s it
o u
i n
void nkjImpementsSutherlandCohen(int polygonPoints[], int
g
vertexPoints, ... )
{
int x1, y1, x2,y2;
int ind, total, decision;
va_list ptr;
va_start(ptr, vertexPoints);
if(vertexPoints%4!=0)
{
printf("nkjError Message! Wrong number of arguments given......\n");
return;
}
total=vertexPoints/4;

for(ind=0;ind<total;ind++)
{
x1=va_arg(ptr,int);
y1=va_arg(ptr,int);
x2=va_arg(ptr,int);
y2=va_arg(ptr,int);
decision=
nkjDecideVisibility(polygonPoints,&x1,&y1,&x2,&y2);
if(decision!=-1)
{
//this implies ine must be drawn and points are stored
//in the corresponding variables
glVertex2i(x1,y1);
o m
.c
glVertex2i(x2,y2);
}
o t
}
sp
}
lo g
. b
int nkjDecideVisibility(int points[], int *x1,int *y1, int *x2, int
e
it
*y2)
{
u s
n o
int code1,code2;
i gxMax=points[0];
yMax=points[1];
xMin=points[2];
yMin=points[3];
for(;;)
{
if(code1==0 && code2==0)

{
//this indicates line is totaly visible

return 1;
}
else if((code1 & code2)!=0)
{
//this implies line is totaly invisible
return -1;
}
else
{
if(*x1>xMax)
{
//finding intersection of line[(x1,y1),(x2,y2)] and xMax
*y1=(((*y2-*y1)/(*x2-*x1))*(xMax-*x1)) + *y1;
*x1=xMax;
}
o m
else if(*x1<xMin)
{
o t .c
s p
//finding intersection of line[(x1,y1),(x2,y2)] and xMin
*x1=xMin;
lo g
*y1=(((*y2-*y1)/(*x2-*x1))*(xMin-*x1)) + *y1;
}
e . b
s it
o u if(*y1>yMax)
{
i g n //finding intersection of line[(x1,y1),(x2,y2)] and yMax

*x1=((yMax-*y1)*((*x2-*x1)/(*y2-*y1))) + *x1;
*y1=yMax;
}
else if(*y1<yMin)
{
//finding intersection of line[(x1,y1),(x2,y2)] and yMin
*x1=((yMin-*y1)*((*x2-*x1)/(*y2-*y1))) + *x1;
*y1=yMin;
}
}
//generating new code for the clipped points

if(code1==0)
{
//interchange two points and respective flags
nkjSwap(x1,x2);
nkjSwap(y1,y2);
nkjSwap(&code1,&code2);
}
}
return -1; //this will never execute, just to satisfy compiler
}
int nkjGenerateCode(int xMax, int yMax, int xMin, int yMin, int x,
int y)
{
o m
.c
int code=0;
//code sequence UDLR
o t
if(x>xMax)
sp
code|=1;//0001 Right bit
else if(x<xMin)
lo g
. b
code|=2;//0010 Left bit
e
if(y>yMax)
s it
o u
code|=8;//1000 Up/Top bit
i g n
else if(y<yMin)
code|=4;//0100 Down/Bottom nit
return code;
}
void nkjSwap(int *x, int *y)

{
*x=*x^*y;
*y=*x^*y;
*x=*x^*y;
}

{
glutInit(&argc,argv);
glutCreateWindow("Sutherland-Cohen by Niraj Kumar Jha");
glutDisplayFunc(nkjDisplayLines);
nkjInit();
glutMainLoop();
}
Output:
o m
o t.c
sp
lo g
e . b
s it
o u
i g n
Output for the given window size, where line is totally invisible.

o m
o t.c
sp
lo g
e . b
sit
o u
i g n

MCSL54 53 Computer Graphics

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

MCSL54 53 Computer Graphics

Hochgeladen von

Copyright:

Verfügbare Formate

Mcsl 054 (53)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

void main(int argc, char **argv)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

void nkjSwap(float *,float *);

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

void main(int argc, char **argv)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

void main(int argc, char *argv[])

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

//function that implements Sutherand-Cohen algorithm

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

int nkjDecideVisibility(int points[], int *x1,int *y1, int *x2, int

www.Ignousite.blogspot.com (ignou study helper)

if(code1==0 && code2==0)

www.Ignousite.blogspot.com (ignou study helper)

//generating new code for the clipped points

www.Ignousite.blogspot.com (ignou study helper)

void nkjSwap(int *x, int *y)

void main(int argc, char **argv)

www.Ignousite.blogspot.com (ignou study helper)

//function that implements Sutherand-Cohen algorithm

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

if(code1==0 && code2==0)

www.Ignousite.blogspot.com (ignou study helper)

i g n //finding intersection of line[(x1,y1),(x2,y2)] and yMax

//generating new code for the clipped points

www.Ignousite.blogspot.com (ignou study helper)

void nkjSwap(int *x, int *y)

void main(int argc, char **argv)

www.Ignousite.blogspot.com (ignou study helper)

www.Ignousite.blogspot.com (ignou study helper)

Das könnte Ihnen auch gefallen

void nkjSwap(float ,float );

int nkjDecideVisibility(int points[], int x1,int y1, int *x2, int

void nkjSwap(int x, int y)

void nkjSwap(int x, int y)