0% found this document useful (0 votes)

20 views56 pages

CG Manual Program

The document outlines a series of practical exercises involving OpenGL programming, including installation steps for Dev C++ and FreeGLUT, as well as implementations of various graphics algorithms such as DDA, Bresenham's line and circle drawing, polygon filling methods, and Cohen-Sutherland polygon clipping. Each practical includes code snippets and instructions for setting up and executing the programs. The document serves as a comprehensive guide for learning and applying computer graphics techniques using OpenGL.

Uploaded by

Mr. Omkar

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

0% found this document useful (0 votes)

20 views56 pages

CG Manual Program

Uploaded by

Mr. Omkar

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/ 56

PRACTICAL NO 01

• Install and explore the OpenGL =

STEP 01-
INSALL DEV C++ APPLICATION AND INSATALL IT.

STEP 2 –
INSTALL OPENGL FREEGLUT3.0.0 FILE AND EXTRACT IT.
STEP 03-

OPEN FREE GLUT INSTALLED FILE DESTINTION -

ALSO OPEN FOLLOWING PATH-

STEP 04-

IN freeglut OPEN INCLUDE FOLDER COPY ALL FILES AND PASTE IN ABOVE OPEN LOCATION IN
INCLUDE FOLDER

Copy above files and paste in following location

C:\Program Files (x86)\Dev-Cpp\MinGW64\x86_64-w64-mingw32\include

STEP 5-
IN freeglut OPEN LIB FOLDER COPY ALL FILES

Copy above files and paste in following location

C:\Program Files (x86)\Dev-Cpp\MinGW64\x86_64-w64-mingw32\lib

STEP 6-

IN freeglut OPEN BIN > X64 FOLDER COPY ALL FILES

Copy above files and paste in following location

C:\Windows\System32

NOW INSTALLATION PROCESS IS COMPLETE

WE ARE READY TO RUN COMPUTER GRAPHICS PROGRAMS

STEP 7-
NOW OPEN DEV C++ AND CREATE NEW PROJECT
STEP 8-
OPEN PROJECT OPTION AND COPY FOLLOWING COMMANDS IN LINKER OPTION
CLICK ON OK .

NOW YOU ARE READY TO WRITE PROGRAM AND RUN IT

HERE WE SUCCESSFULLY RUN THE PROGRAM

Practical No:2
1)Implement DDA and Bresenham line drawing algorithm to draw: i) Simple Line ii) Dotted
Line iii) Dashed Line iv) Solid line; using mouse interface Divide the screen in four quadrants
with center as (0, 0). The line should work for all the slopes positive as well as negative.
Code:
#include<iostream>

#include<GL/glut.h> using

namespace std; int Algo,type;

void Init()
{
glClearColor(0,0,0,0); glColor3f(0,1,0);

gluOrtho2D(0,640,0,480);

glClear(GL_COLOR_BUFFER_BIT);
}
int sign(float a){ if(a==0){

return 0;
}
if(a>0){ return

}
return -1;
}
void B_Line(int x_1,int y_1,int x_2,int y_2,int t){ float

dy, dx, m , P;

dy = y_2 - y_1;

dx = x_2 - x_1;

m = dy/dx;

P = 2*dy - dx;
int x = x_1, y = y_1;
cout<<"\n x1 = "<<x<<" y1 = "<<y;

if(m<1){

int cnt=1;
for(int i=0; i<=dx;i++){

if(t == 1){
glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
if(t == 2){ if(i%2==0){

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
}
if(t == 3){
if(cnt <= 10){
glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
cnt++;
if(cnt == 15){
cnt =1;
}
} if(P<0){

x = x +1; y

=y;

P = P + 2*dy;
}
else{
x= x+1; y

= y+1;

P = P + 2*dy - 2*dx;
}
}
}
else{
int cnt = 1;
for(int i=0;i<=dy;i++){ if

(t == 1){

glBegin(GL_POINTS);
glVertex2i(x,y);

glEnd();

}
if(t == 2){ if(i%2==0){

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
}
if(t == 3){
if(cnt <= 10){

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();

}
cnt++;
if(cnt == 15){
cnt =1;
}
} if(P<0){

x = x;
y =y+1;
P = P + 2*dx;
}
else{

x= x+1; y

= y+1;

P = P + 2*dx - 2*dy;
}
}
}
cout<<"\n xlast = "<<x<<" ylast = "<<y; glFlush();

}
void DDA_LINE(int x_1,int y_1,int x_2,int y_2, int t){ float

dx,dy,length;
dx = x_2-x_1; dy

= y_2-y_1;

if(abs(dx) >= abs(dy)){

length = abs(dx);

}
else{
length = abs(dy);
}
float xin, yin; xin

= dx/length; yin =

dy/length; float

x,y;

x = x_1 + 0.5 * sign(xin);

y = y_1 + 0.5 * sign(yin); int

i=0;

int cnt =1;

while(i<=length){

if(t == 1){

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();

}
if(t == 2){

if(i%2==0){

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
}
if(t == 3){
if(cnt <= 10){ glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();
}
cnt++;
if(cnt == 15){
cnt =1;
}
}
x = x + xin;

y = y + yin;

i++ ;

}
glFlush();
}
void display()
{
DDA_LINE(0,240,640,240,1);

B_Line(320,0,320,640,1);

glFlush();
}
void mymouse(int b,int s, int x, int y)
{
static int x_s,y_s,x_e,y_e,pt=0; if(b==GLUT_LEFT_BUTTON

&& s==GLUT_DOWN)

{
if(pt==0)
{
x_s =x;
y_s =480 - y; pt++;

glBegin(GL_POINTS);

glVertex2i(x_s,y_s);

glEnd();
}
else
{
x_e=x;

y_e=480-y;

cout<<"\n x_1_click "<<x_s<<" y_1_click "<<y_s; cout<<"\n

x_2_click "<<x_e<<" y_2_click "<<y_e<<"\n";

glBegin(GL_POINTS);
glVertex2i(x_e,y_e);

glEnd();

if(Algo == 1){ DDA_LINE(x_s,y_s,x_e,y_e,type);

}
if(Algo == 2){

B_Line(x_s,y_s,x_e,y_e,type);

}
}
}
else if(b==GLUT_RIGHT_BUTTON && s==GLUT_DOWN)
{
pt=0;
}
glFlush();
}
int main(int argc ,char **argv)
{

cout<<"\n Select the Algorithm \n 1. DDA \n 2. Bresenham's \n"; cin>>Algo;

cout<<"Select the Line Type \n 1. Simple Line \n 2. Dotted Line\n 3. Dashed Line
\n";
cin>>type;
if((Algo == 1 || Algo == 2 )&&(type==1 || type==2 || type==3)){
}
else{
cout<<"\n Option enter are wrong \n"; return 0;

}
glutInit(&argc,argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);

glutInitWindowPosition(100,100);

glutInitWindowSize(640,480);

glutCreateWindow("DDA-Line");

Init(); glutDisplayFunc(display);

glutMouseFunc(mymouse);

glutMainLoop();

return 0;
}
Output:
Practical No:3
1) Implement Bresenham circle drawing algorithm to draw any object. The
object should be displayed in all the quadrants with respect to center and
radius.
Code:-
#include<GL/glut.h>
#include<iostream>
using namespace std;
int r;
void E_way(int x, int y){
glBegin(GL_POINTS);
glVertex2i(x+320,y+240);
glVertex2i(y+320,x+240);
glVertex2i(y+320, -x+240);
glVertex2i(x+320, -y+240);
glVertex2i(-x+320,-y+240);
glVertex2i(-y+320,-x+240);
glVertex2i(-y+320,x+240);
glVertex2i(-x+320,y+240);
glEnd();
glFlush();
}
void B_circle()
{
float d;
d = 3 - 2*r;
int x,y;
x=0;
y=r;

do{
E_way(x,y);
if(d<0){
d=d+4*x+6;
}
else{
d= d+4*(x-y)+10;
y=y-1;
}
x=x+1;
}while(x<y);
}
void init(){
glClearColor(1,1,1,0);
glColor3f(1,0,0);
gluOrtho2D(0,640,0,480);
glClear(GL_COLOR_BUFFER_BIT);
}
int main(int argc, char **argv){
cout<<"\n Enter Radius \t ";
cin>>r;
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
glutInitWindowPosition(100,100);
glutInitWindowSize(640,480);
glutCreateWindow("Circle");
init(); glutDisplayFunc(B_circle);
glutMainLoop();
return 0;
}

Output:-
Practical No:4
1)Implement the following polygon filling methods : i) Flood fill / Seed fill
ii) Boundary fill ; using mouse click, keyboard interface and menu driven
programming.
Code:
#include <iostream>

#include <math.h> #include

<GL/glut.h> using

namespace std; float

R=0,G=0,B=0;

int Algo; void

init(){

glClearColor(1.0,1.0,1.0,0.0);

glMatrixMode(GL_PROJECTION);

gluOrtho2D(0,640,0,480);

void floodFill(int x, int y, float newCol, float oldcol){ float

pixel[3]; glReadPixels(x,y,1,1,GL_RGB,GL_FLOAT,pixel);

if(oldcol[0]==pixel[0] && oldcol[1]==pixel[1] && oldcol[2]==pixel[2]){

glBegin(GL_POINTS);

glColor3f(newCol[0],newCol[1],newCol[2]); glVertex2i(x,y);

glEnd(); glFlush();

floodFill(x,y+1,newCol,oldcol);

floodFill(x+1,y,newCol,oldcol);

floodFill(x,y-1,newCol,oldcol);

floodFill(x-1,y,newCol,oldcol);

}
void boundaryFill(int x, int y, float* fillColor, float* bc){ float

color[3]; glReadPixels(x,y,1.0,1.0,GL_RGB,GL_FLOAT,color);

if((color[0]!=bc[0] || color[1]!=bc[1] || color[2]!=bc[2]) &&

(fillColor[0]!=color[0] || fillColor[1]!=color[1] || fillColor[2]!=color[2])){

glColor3f(fillColor[0],fillColor[1],fillColor[2]);

glBegin(GL_POINTS);

glVertex2i(x,y);

glEnd();

glFlush();

boundaryFill(x+1,y,fillColor,bc);

boundaryFill(x-1,y,fillColor,bc);

boundaryFill(x,y+1,fillColor,bc);

boundaryFill(x,y-1,fillColor,bc);

return;

void mouse(int btn, int state, int x, int y){ y =

480-y;

if(btn == GLUT_LEFT_BUTTON && state == GLUT_DOWN){ float bcol[] =

{1,0,0};

float oldcol[] = {1,1,1};

float newCol[] = {R,G,B};

if(Algo==1){

boundaryFill(x,y,newCol,bcol);

if(Algo==2){ floodFill(x,y,newCol,oldcol);

} }
}

void B_Draw(){ glClear(GL_COLOR_BUFFER_BIT);

glColor3f(1,0,0); glBegin(GL_LINE_LOOP);

glVertex2i(150,100);

glVertex2i(300,300);

glVertex2i(450,100);

glEnd();

glFlush();

void F_Draw(){ glClear(GL_COLOR_BUFFER_BIT);

glBegin(GL_LINES);

glColor3f(1,0,0);glVertex2i(150,100);glVertex2i(300,300); glEnd();

glBegin(GL_LINE_LOOP);

glColor3f(0,0,1);glVertex2i(300,300);glVertex2i(450,100); glEnd();

glBegin(GL_LINE_LOOP);

glColor3f(0,0,0);glVertex2i(450,100);glVertex2i(150,100); glEnd();

glFlush();

void goMenu(int value){

switch(value){

case 1:
R = 0, G = 1, B=0;
break;

case 2:

R = 1, G = 1, B=0;
break;
case 3:
R = 1, G = 0, B=1;
break;
}
glutPostRedisplay();

int main(int argc, char** argv){ cout<<"\n \t

Select the Algorithm ";

cout<<"\n \t 1. Boundary Fill Algorithm ";

cout<<"\n \t 2. Flood Fill Algorithm \n \t";

cin>>Algo;

glutInit(&argc, argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);

glutInitWindowSize(640,480);

glutInitWindowPosition(200,200); glutCreateWindow("A4");

init(); glutCreateMenu(goMenu);

glutAddMenuEntry("Color 1 Green",1);

glutAddMenuEntry("Color 2 Yellow",2);

glutAddMenuEntry("Color 3 Pink",3);

glutAttachMenu(GLUT_RIGHT_BUTTON);

if(Algo==1){

glutDisplayFunc(B_Draw);
}

if(Algo==2){

glutDisplayFunc(F_Draw);

glutMouseFunc(mouse);

glutMainLoop();

return 0;

}
Output:
Practical No:5
1) Implement Cohen Sutherland polygon clipping method to clip the polygon
with respect the viewport and window. Use mouse click, keyboard interface.

Code:
#include <iostream>
#include <math.h>
#include <time.h>
#include <GL/glut.h>
using namespace std;
int wxmin = 200,wxmax=500,wymax=350, wymin=100;
int points[10][2];
int edge;
void init(){
glClearColor(1.0,1.0,1.0,0.0);
glMatrixMode(GL_PROJECTION);
gluOrtho2D(0,640,0,480);
glClear(GL_COLOR_BUFFER_BIT);
}
void Draw(){
glClearColor(1.0,1.0,1.0,0.0);
glClear(GL_COLOR_BUFFER_BIT);
glColor3f(0.2,0.2,1);
glBegin(GL_POLYGON);
for(int i=0; i<edge; i++)
{
glVertex2i(points[i][0],points[i][1]);
}
glEnd();
glFlush();
glColor3f(0,1,0);
glBegin(GL_LINE_LOOP);
glVertex2i(200,100);
glVertex2i(500,100);
glVertex2i(500,350);
glVertex2i(200,350);
glEnd();
glFlush();
}
int BottomCliping(int e){
float m=0;
int x=0,k=0;
int t[10][2];
for(int i=0; i<e; i++){
if(points[i][1] < wymin){
if(points[i+1][1] < wymin){
}
else if(points[i+1][1] > wymin){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
x = ((1/((y2-y1)/(x2-x1))) * (wymin - y1) )+ x1;
t[k][0] = x;
t[k][1] = wymin;
k++;
}
}
else if(points[i][1]>wymin){
if(points[i+1][1] > wymin){
t[k][0] = points[i][0];
t[k][1] = points[i][1];
k++;
}
else if(points[i+1][1] < wymin){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
x = ((1/((y2-y1)/(x2-x1))) * (wymin - y1) )+ x1;
t[k][0] = x1;
t[k][1] = y1;
k++;
t[k][0] = x;
t[k][1] = wymin;
k++;
}
}
}
cout<<"k = "<<k;
for(int i=0; i<10;i++)
{
points[i][0] = 0;
points[i][1] = 0;
}
for(int i=0; i<k;i++)
{
cout<<"\n"<<t[i][0]<<" "<<t[i][1];
points[i][0] = t[i][0];
points[i][1] = t[i][1];
}
points[k][0] = points[0][0];
points[k][1] = points[0][1];
return k;
}
int TopCliping(int e){
float m=0;
int x=0,k=0;
int t[10][2];
for(int i=0; i<e; i++){
if(points[i][1] > wymax){
if(points[i+1][1] > wymax){
}

else if(points[i+1][1] < wymax){

float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
x = ((1/((y2-y1)/(x2-x1))) * (wymax - y1) )+ x1;
t[k][0] = x;
t[k][1] = wymax;
k++;
}
}
else if(points[i][1]<wymax){
if(points[i+1][1] < wymax){
t[k][0] = points[i][0];
t[k][1] = points[i][1];
k++;
}
else if(points[i+1][1] > wymax){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
x = ((1/((y2-y1)/(x2-x1))) * (wymax - y1) )+ x1;
t[k][0] = x1;

t[k][1] = y1;
k++;
t[k][0] = x;
t[k][1] = wymax;
k++;
}
}
}
cout<<"k = "<<k;
for(int i=0; i<10;i++)
{
points[i][0] = 0;
points[i][1] = 0;
}

for(int i=0; i<k;i++)

{
cout<<"\n"<<t[i][0]<<" "<<t[i][1];
points[i][0] = t[i][0];
points[i][1] = t[i][1];
}
points[k][0] = points[0][0];
points[k][1] = points[0][1];
return k;
}
int leftCliping(int e){
float m=0;
int y=0, k = 0;

int t[10][2];
for(int i=0;i<e;i++)
{
if(points[i][0] < wxmin){
if(points[i+1][0] < wxmin){
cout<<"\n Test 1";
}
else if (points[i+1][0] > wxmin){
cout<<"\n Test 2";
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
y = (((y2-y1)/(x2-x1)) * (wxmin - x1) )+ y1;
t[k][0] = wxmin;
t[k][1] = y;
k++;
}
}
else if(points[i][0] > wxmin){
if(points[i+1][0] > wxmin){
t[k][0] = points[i][0];
t[k][1] = points[i][1];
k++;
}
else if(points[i+1][0] < wxmin){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
y = ((y2-y1)/(x2-x1)*(wxmin - x1)) + y1;
t[k][0] = x1;
t[k][1] = y1;
k++;
t[k][0] = wxmin;
t[k][1] = y;
k++;
}
}
}
cout<<"k = "<<k;
for(int i=0; i<10;i++)
{
points[i][0] = 0;
points[i][1] = 0;
}
for(int i=0; i<k;i++)
{
cout<<"\n"<<t[i][0]<<" "<<t[i][1];
points[i][0] = t[i][0];
points[i][1] = t[i][1];
}
points[k][0] = points[0][0];
points[k][1] = points[0][1];
return k;
}
int RightCliping(int e){
float m=0;
int y=0, k = 0;
int t[10][2];
for(int i=0;i<e;i++)
{
if(points[i][0] > wxmax){
if(points[i+1][0] > wxmax){
}
else if(points[i+1][0] < wxmax){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
y = (((y2-y1)/(x2-x1)) * (wxmax - x1) )+ y1; t[k][0]
= wxmax;
t[k][1] = y;
k++;
}
}
else if(points[i][0] < wxmax){
if(points[i+1][0] < wxmax){ t[k][0]
= points[i][0];
t[k][1] = points[i][1];
k++;
}
else if(points[i+1][0] > wxmax){
float x1,x2;
float y1,y2;
x1 = points[i][0];
y1 = points[i][1]; x2
= points[i+1][0]; y2
= points[i+1][1];
y = ((y2-y1)/(x2-x1)*(wxmax - x1)) + y1;
t[k][0] = x1;
t[k][1] = y1;
k++;
t[k][0] = wxmax;
t[k][1] = y;
k++;
}
}
}
cout<<"k = "<<k;
for(int i=0; i<10;i++)
{
points[i][0] = 0;
points[i][1] = 0;
}
for(int i=0; i<k;i++)
{
cout<<"\n"<<t[i][0]<<" "<<t[i][1];
points[i][0] = t[i][0];
points[i][1] = t[i][1];
}
points[k][0] = points[0][0];
points[k][1] = points[0][1];
return k;
}
void P_C(){
Draw();
}
void goMenu(int value){
switch(value){
case 1:
edge = leftCliping(edge);
Draw();
break;
case 2:
edge = RightCliping(edge);
Draw();
break;
case 3:
edge = TopCliping(edge);
Draw();
break;
case 4:
edge = BottomCliping(edge);
Draw();
break;
}
glutPostRedisplay();
}
int main(int argc, char** argv){
cout<<"\n Enter No of edges of polygon ";
cin>>edge;
for(int i=0;i<edge;i++){
cout<<"\n Enter point "<<i<<" x space y ";
cin>>points[i][0]>>points[i][1];
}
points[edge][0] = points[0][0];
points[edge][1] = points[0][1];
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);
glutInitWindowSize(640,480); glutInitWindowPosition(200,200);
glutCreateWindow("Polygon Clipping");
init();
glutCreateMenu(goMenu);
glutAddMenuEntry("Left",1);
glutAddMenuEntry("Right",2);
glutAddMenuEntry("Top",3);
glutAddMenuEntry("Bottom",4);
glutAttachMenu(GLUT_RIGHT_BUTTON);
glutDisplayFunc(P_C);
glutMainLoop();
return 0;
}
Output:
Practical No:6
1)Implement following 2D transformations on the object with respect to axis :
i) Scaling ii) Rotation about arbitrary point iii) Reflection

Code:
#include <iostream>

#include <math.h>

#include <time.h>

#include <GL/glut.h>

#include <vector>

using namespace std;

int edge;

vector<int> xpoint;

vector<int> ypoint;

int ch;

double round(double d){

return floor(d + 0.5);

void init(){

glClearColor(1.0,1.0,1.0,0.0);

glMatrixMode(GL_PROJECTION);

gluOrtho2D(0,640,0,480);

glClear(GL_COLOR_BUFFER_BIT);

void translation(){

int tx, ty;

cout<<"\t Enter Tx, Ty \n";

cin>> tx>> ty;

for(int i=0;i<edge;i++){ xpoint[i]

= xpoint[i] + tx; ypoint[i] =

ypoint[i] + ty;

glBegin(GL_POLYGON);

glColor3f(0,0,1);

for(int i=0;i<edge;i++){

glVertex2i(xpoint[i],ypoint[i]);

glEnd();

glFlush();

void rotaion(){

int cx, cy;

cout<<"\n Enter Ar point x , y "; cin

>> cx >> cy;

cx = cx+320;

cy = cy+240;

glColor3f(0.0, 1.0, 0.0);

glBegin(GL_POINTS);

glVertex2i(cx,cy);

glEnd();

glFlush();

double the;

cout<<"\n Enter thetha ";

cin>>the;

the = the * 3.14/180;

glColor3f(0,0,1.0);

glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){

glVertex2i(round(((xpoint[i] - cx)cos(the) - ((ypoint[i]-cy)sin(the))) + cx),

round(((xpoint[i] - cx)sin(the) + ((ypoint[i]-cy)cos(the))) + cy));

glEnd();

glFlush();

void scale(){

glColor3f(1.0,0,0);

glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){

glVertex2i(xpoint[i]-320,ypoint[i]-240);

glEnd();

glFlush();

cout<<"\n\tIn Scaling whole screen is 1st Qudrant \n"; int

sx, sy;

cout<<"\t Enter sx, sy \n";

cin>> sx>> sy;

for(int i=0;i<edge;i++){

xpoint[i] = (xpoint[i]-320) * sx;

ypoint[i] = (ypoint[i]-240) * sy;

}

glColor3f(0,0,1.0);

glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){

glVertex2i(xpoint[i],ypoint[i]);

glEnd();

glFlush();

void reflection(){

char reflection;

cout<<"Enter Reflection Axis \n";

cin>> reflection;

if(reflection == 'x' || reflection == 'X'){

glColor3f(0.0,0.0,1.0); glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){

glVertex2i(xpoint[i], (ypoint[i] * -1)+480);

glEnd();

glFlush();

else if(reflection == 'y' || reflection == 'Y'){

glColor3f(0.0,0.0,1.0); glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){
glVertex2i((xpoint[i] * -1)+640,(ypoint[i]));

glEnd();

glFlush();

void Draw(){

if(ch==2 || ch==3 || ch==4){

glColor3f(1.0,0,0);

glBegin(GL_LINES);

glVertex2i(0,240);

glVertex2i(640,240);

glEnd();

glColor3f(1.0,0,0);

glBegin(GL_LINES);

glVertex2i(320,0);

glVertex2i(320,480);

glEnd();

glFlush();

glColorf(1.0,0,0);

glBegin(GL_POLYGON);

for(int i=0;i<edge;i++){

glVertex2i(xpoint[i],ypoint[i]);

glEnd();

glFlush();
}

if(ch==1){

scale();

else if(ch == 2){

rotaion();

else if( ch == 3){

reflection();

else if (ch == 4){

translation();

int main(int argc, char** argv){

cout<<"\n \t Enter 1) Scaling ";

cout<<"\n \t Enter 2) Rotation about arbitrary point"; cout<<"\n

\t Enter 3) Reflection";

cout<<"\n \t Enter 4) Translation \n \t";

cin>>ch;

if(ch==1 || ch==2 || ch==3 || ch==4){

cout<<"Enter No of edges \n"; cin>>

edge;

int xpointnew, ypointnew;

cout<<" Enter"<< edge <<" point of polygon \n";

for(int i=0;i<edge;i++){
cout<<"Enter "<< i << " Point ";

cin>>xpointnew>>ypointnew;

xpoint.push_back(xpointnew+320);

ypoint.push_back(ypointnew+240);

glutInit(&argc, argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);

glutInitWindowSize(640,480);

glutInitWindowPosition(200,200);

glutCreateWindow("2D");

init();

glutDisplayFunc(Draw);

glutMainLoop();

return 0;

else{

cout<<"\n \t Check Input run again";

return 0;

}
Output:
Practical No:7
1) Generate fractal patterns using i) Bezier ii) Koch Curve.

Code: i) Bezier Curve

#include <iostream>
#include <math.h>
#include <time.h>
#include <GL/glut.h>
using namespace std; int
x[4],y[4];
void init()
{
glClearColor(1.0,1.0,1.0,0.0);
glMatrixMode(GL_PROJECTION);
gluOrtho2D(0,640,0,480);
glClear(GL_COLOR_BUFFER_BIT);
}
void putpixel(double xt,double yt )
{
glColor3f(1,0,0);
glBegin(GL_POINTS);
glVertex2d(xt,yt);
glEnd();
glFlush();
}
void Algorithm()
{
glColor3f(0,1,0);
glBegin(GL_LINES);
glVertex2i(x[0],y[0]);
glVertex2i(x[1],y[1]);
glVertex2i(x[1],y[1]);
glVertex2i(x[2],y[2]);
glVertex2i(x[2],y[2]);
glVertex2i(x[3],y[3]);
glEnd();
glFlush();
double t;
for (t = 0.0; t < 1.0; t += 0.0005)
{
double xt = pow(1-t, 3) * x[0] + 3 * t * pow(1-t, 2) * x[1] + 3 * pow(t, 2)
* (1-t) * x[2] + pow(t, 3) * x[3];
double yt = pow(1-t, 3) * y[0] + 3 * t * pow(1-t, 2) * y[1] + 3 * pow(t, 2)
* (1-t) * y[2] + pow(t, 3) * y[3];
putpixel(xt, yt);
}
}
int main(int argc, char** argv)
{
cout<<"\n \t Enter The Four Points x space y "; for(int
i=0;i<4;i++)
{
cout<<"\n \t Enter x and y for "<<i<<" = "; cin>>x[i]>>y[i];
}
glutInit(&argc, argv);
glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);
glutInitWindowSize(640,480); glutInitWindowPosition(200,200);
glutCreateWindow("Bezier 4 point");
init(); glutDisplayFunc(Algorithm);
glutMainLoop();
return 0;
}
Output:
Code: ii) Koch Curve

#include <iostream>

#include <math.h>

#include <time.h>

#include <GL/glut.h> using

namespace std; double

x,y,len,angle; int it;

void init()

glClearColor(1.0,1.0,1.0,0.0);

glMatrixMode(GL_PROJECTION);

gluOrtho2D(0,640,0,480);

glClear(GL_COLOR_BUFFER_BIT);

void line1(int x1, int y11, int x2,int y2)

glColor3f(0,1,0);

glBegin(GL_LINES);

glVertex2i(x1,y11);

glVertex2i(x2,y2);

glEnd();

glFlush();

void k_curve(double x, double y, double len, double angle, int it)

if(it>0){ len
/=3;

k_curve(x,y,len,angle,(it-1));

x += (len * cosl(angle * (M_PI)/180)); y +=

(len * sinl(angle * (M_PI)/180));

k_curve(x,y, len, angle+60,(it-1));

x += (len * cosl((angle + 60) * (M_PI)/180)); y +=

(len * sinl((angle + 60) * (M_PI)/180));

k_curve(x,y, len, angle-60,(it-1));

x += (len * cosl((angle - 60) * (M_PI)/180)); y +=

(len * sinl((angle - 60) * (M_PI)/180));

k_curve(x,y,len,angle,(it-1));

else

line1(x,y,(int)(x + len * cosl(angle * (M_PI)/180) + 0.5),(int)(y + len * sinl(angle *

(M_PI)/180) + 0.5));

}
void Algorithm()

k_curve(x,y,len,angle,it);

int main(int argc, char** argv)

cout<<"\n Enter Starting Point x space y ";

cin>>x>>y;

cout <<"\n Lenght of line and space angle of line";

cin>>len>>angle;

cout<<"\n No. of ittration "; cin>>it;

glutInit(&argc, argv);

glutInitDisplayMode(GLUT_SINGLE|GLUT_RGB);

glutInitWindowSize(640,480); glutInitWindowPosition(200,200);

glutCreateWindow("Koch");

init(); glutDisplayFunc(Algorithm);

glutMainLoop();

return 0;

Output:
Practical No:8
1) Implement animation principles for any object .
Code:
#include <iostream>

#include <math.h>

#include <time.h>

#include <GL/glut.h>

using namespace std;

int x=0;

int flag=0;

void init()

glClearColor(1.0,1.0,1.0,0.0);

glMatrixMode(GL_PROJECTION);

gluOrtho2D(0,640,0,480);

void object1()

glClear(GL_COLOR_BUFFER_BIT);

glColor3f(1,0,0);

glBegin(GL_POLYGON);

glVertex2i(x,220);

glVertex2i(x+40,220);

glVertex2i(x+40,260);

glVertex2i(x,260);
glEnd();

glutSwapBuffers();

void timer(int)

glutPostRedisplay();

glutTimerFunc(1000/60,timer,0);

if(flag == 0)

x = x+3;

if(flag == 1)

x = x-3;

if(x==600)

flag = 1;

if(x == 0)

flag = 0;

}
int main(int argc, char** argv)

glutInit(&argc, argv);

glutInitDisplayMode(GLUT_DOUBLE | GLUT_RGB);

glutInitWindowSize(640,480);

glutInitWindowPosition(200,200);

glutCreateWindow("Animation");

init();

glutDisplayFunc(object1);

glutTimerFunc(1000,timer,0);

glutMainLoop();

return 0;

}
Output:

OpenGL Line and Shape Algorithms
No ratings yet
OpenGL Line and Shape Algorithms
34 pages
COMPUTER GRAPHICS LABORATORY WITH MINI PROJECT Manual
No ratings yet
COMPUTER GRAPHICS LABORATORY WITH MINI PROJECT Manual
28 pages
CG Lab4 Assignment 2021IMT015 APOORV JAIN
No ratings yet
CG Lab4 Assignment 2021IMT015 APOORV JAIN
27 pages
CGL As7
No ratings yet
CGL As7
4 pages
Dda
No ratings yet
Dda
2 pages
Laboratory CG&IP
No ratings yet
Laboratory CG&IP
20 pages
Assignment 7
No ratings yet
Assignment 7
5 pages
Bresenham's Line & 2D/3D Transformations
No ratings yet
Bresenham's Line & 2D/3D Transformations
15 pages
21X505 Problem Sheet3
No ratings yet
21X505 Problem Sheet3
10 pages
All CG Programs
No ratings yet
All CG Programs
45 pages
OpenGL Graphics Programming
No ratings yet
OpenGL Graphics Programming
30 pages
OpenGL Basics for Developers
No ratings yet
OpenGL Basics for Developers
25 pages
C++ Line Drawing & OpenGL Animation
No ratings yet
C++ Line Drawing & OpenGL Animation
42 pages
Tinywow - Computer Graphics Experiments (2) - 41880454
No ratings yet
Tinywow - Computer Graphics Experiments (2) - 41880454
77 pages
1.write A Program To Implement DDA Line Drawing Algorithm. Program
No ratings yet
1.write A Program To Implement DDA Line Drawing Algorithm. Program
21 pages
DDA Line Drawing Algorithm
No ratings yet
DDA Line Drawing Algorithm
39 pages
Assignment 2 CG
No ratings yet
Assignment 2 CG
18 pages
Polygon Fill
No ratings yet
Polygon Fill
3 pages
Program 1:-Implement Bresenham's Line Drawing Algorithm For All Types of Slope
No ratings yet
Program 1:-Implement Bresenham's Line Drawing Algorithm For All Types of Slope
25 pages
CG Prog
No ratings yet
CG Prog
15 pages
CG Lab2
No ratings yet
CG Lab2
15 pages
CG Lab Manual
No ratings yet
CG Lab Manual
18 pages
CG 2
No ratings yet
CG 2
5 pages
Breshnamline
No ratings yet
Breshnamline
2 pages
OpenGL Graphics Programming
No ratings yet
OpenGL Graphics Programming
10 pages
(Aakarshit Doda) (2021-IMG-001) (Assignment 3)
No ratings yet
(Aakarshit Doda) (2021-IMG-001) (Assignment 3)
26 pages
GLUT Shape Rendering Demo
No ratings yet
GLUT Shape Rendering Demo
7 pages
A) Program To Implement A FLYING KITE
No ratings yet
A) Program To Implement A FLYING KITE
36 pages
Bresenham Line With Mouse Interface
No ratings yet
Bresenham Line With Mouse Interface
4 pages
22x055 ps6
No ratings yet
22x055 ps6
26 pages
C Program To Color The Different Figures Drawn On The Console Using OpenGL
No ratings yet
C Program To Color The Different Figures Drawn On The Console Using OpenGL
8 pages
Lab Manual CG and Image Processing 21 Scheme
No ratings yet
Lab Manual CG and Image Processing 21 Scheme
27 pages
Bresenham's Line Drawing Program
No ratings yet
Bresenham's Line Drawing Program
25 pages
Programs
No ratings yet
Programs
16 pages
Program No
No ratings yet
Program No
59 pages
OpenGL & Graphics Lab Guide
No ratings yet
OpenGL & Graphics Lab Guide
26 pages
First Internals Optimized Code
No ratings yet
First Internals Optimized Code
22 pages
PR 7 CG
No ratings yet
PR 7 CG
6 pages
OpenGL Graphics Programming
No ratings yet
OpenGL Graphics Programming
43 pages
OpenGL C Animation: Revolution
No ratings yet
OpenGL C Animation: Revolution
6 pages
Computer Graphics and Animation Assignment 1
No ratings yet
Computer Graphics and Animation Assignment 1
44 pages
DDA Line Drawing Algorithm
No ratings yet
DDA Line Drawing Algorithm
2 pages
CG Computer Graphics Lab
No ratings yet
CG Computer Graphics Lab
45 pages
Lab Program - 1: Implement Bresenham's Line Drawing Algorithm For All Types of Slope
No ratings yet
Lab Program - 1: Implement Bresenham's Line Drawing Algorithm For All Types of Slope
25 pages
Computer Graphics Lab Guide
No ratings yet
Computer Graphics Lab Guide
32 pages
CGI Manual @vtuupdates Com
No ratings yet
CGI Manual @vtuupdates Com
37 pages
CG Lab
No ratings yet
CG Lab
14 pages
Koch Curve - CPP
No ratings yet
Koch Curve - CPP
2 pages
Program To Generate A Line Using DDA Algorithm
No ratings yet
Program To Generate A Line Using DDA Algorithm
56 pages
Computer Graphics Assignment
No ratings yet
Computer Graphics Assignment
5 pages
Link Click
No ratings yet
Link Click
36 pages
Amcsl 054
No ratings yet
Amcsl 054
8 pages
Star
No ratings yet
Star
9 pages
CG Practical 6
No ratings yet
CG Practical 6
8 pages
Implement Brenham's Line Drawing Algorithm For All Types of Slope
No ratings yet
Implement Brenham's Line Drawing Algorithm For All Types of Slope
24 pages
Line Drawing Algorithms Guide
No ratings yet
Line Drawing Algorithms Guide
6 pages
Computer Graphics and Animation Assignment 1
No ratings yet
Computer Graphics and Animation Assignment 1
44 pages
CG Lab Manual
No ratings yet
CG Lab Manual
27 pages
Cglab
No ratings yet
Cglab
43 pages
Oop Report
No ratings yet
Oop Report
32 pages
Micro Project CNR
No ratings yet
Micro Project CNR
22 pages
Oop Project Proposal 1
No ratings yet
Oop Project Proposal 1
4 pages
Micro Project Sne
No ratings yet
Micro Project Sne
23 pages
ETI MicroProject
No ratings yet
ETI MicroProject
24 pages
Msbte Board Question Paper
No ratings yet
Msbte Board Question Paper
162 pages
MAN MicroProject
No ratings yet
MAN MicroProject
23 pages
Practical 17
No ratings yet
Practical 17
2 pages
Practical No 10 To 14
No ratings yet
Practical No 10 To 14
12 pages
Practical 18.1
No ratings yet
Practical 18.1
2 pages
PB lb2
No ratings yet
PB lb2
7 pages
Consumer Buying Behaviour Towards Smartphone
80% (30)
Consumer Buying Behaviour Towards Smartphone
36 pages
Upload Files to Box in C# Guide
No ratings yet
Upload Files to Box in C# Guide
2 pages
Circuit Theory Syllabus PDF
No ratings yet
Circuit Theory Syllabus PDF
2 pages
High Efficiency 200W Power Supply For Leds Lighting Applications
No ratings yet
High Efficiency 200W Power Supply For Leds Lighting Applications
21 pages
CH-4 Input Output
No ratings yet
CH-4 Input Output
18 pages
SAS Presentation
No ratings yet
SAS Presentation
49 pages
Bata Shoe Organization Term Paper
No ratings yet
Bata Shoe Organization Term Paper
26 pages
TLR+9Trainer Hyper2k
No ratings yet
TLR+9Trainer Hyper2k
2 pages
Tutorial 2
No ratings yet
Tutorial 2
2 pages
Lesson 3
No ratings yet
Lesson 3
24 pages
حساس ليجراند
No ratings yet
حساس ليجراند
32 pages
Big Data & SoS in Global Supply Chain
No ratings yet
Big Data & SoS in Global Supply Chain
7 pages
Systems Development Methods CT046-3-2-SDMS Page 1 of 3
No ratings yet
Systems Development Methods CT046-3-2-SDMS Page 1 of 3
4 pages
Analyzing Reliability in The Data Center Outline
No ratings yet
Analyzing Reliability in The Data Center Outline
5 pages
Implement A Simple Neural Network in C# .NET - Part 1
No ratings yet
Implement A Simple Neural Network in C# .NET - Part 1
7 pages
A High Efficiency Flyback Micro-Inverter With A New Adaptive Snubber For Photovoltaic Applications
No ratings yet
A High Efficiency Flyback Micro-Inverter With A New Adaptive Snubber For Photovoltaic Applications
29 pages
Data Communication Basics Ch1
No ratings yet
Data Communication Basics Ch1
55 pages
IT Software Engineer Appraisal
100% (2)
IT Software Engineer Appraisal
3 pages
7 - Perfect Square and Square Root
No ratings yet
7 - Perfect Square and Square Root
26 pages
Ruijie RG-MACC-BASE - 3.2 - Build20180929 User Guide
No ratings yet
Ruijie RG-MACC-BASE - 3.2 - Build20180929 User Guide
90 pages
Training Material of MT27 Series Chassis 2013jun27 Thur
No ratings yet
Training Material of MT27 Series Chassis 2013jun27 Thur
33 pages
Sl1din 485
No ratings yet
Sl1din 485
1 page
Roadway Modeling Basics
No ratings yet
Roadway Modeling Basics
111 pages
If Postbridge
No ratings yet
If Postbridge
262 pages
T24-Dates Manipulation
50% (2)
T24-Dates Manipulation
2 pages
Windows Server 2012 R2 Deployment Guide
No ratings yet
Windows Server 2012 R2 Deployment Guide
20 pages
Thesis Margins Word
100% (3)
Thesis Margins Word
8 pages
Kate Adu-Frimpong - Resume
No ratings yet
Kate Adu-Frimpong - Resume
2 pages
Azhagarsami. P: Mobile: 96559 39010 Career Objective
No ratings yet
Azhagarsami. P: Mobile: 96559 39010 Career Objective
3 pages

CG Manual Program

Uploaded by

CG Manual Program

Uploaded by

PRACTICAL NO 01

• Install and explore the OpenGL =

OPEN FREE GLUT INSTALLED FILE DESTINTION -

ALSO OPEN FOLLOWING PATH-

Copy above files and paste in following location

C:\Program Files (x86)\Dev-Cpp\MinGW64\x86_64-w64-mingw32\include

Copy above files and paste in following location

C:\Program Files (x86)\Dev-Cpp\MinGW64\x86_64-w64-mingw32\lib

IN freeglut OPEN BIN > X64 FOLDER COPY ALL FILES

Copy above files and paste in following location

NOW INSTALLATION PROCESS IS COMPLETE

WE ARE READY TO RUN COMPUTER GRAPHICS PROGRAMS

NOW YOU ARE READY TO WRITE PROGRAM AND RUN IT

HERE WE SUCCESSFULLY RUN THE PROGRAM

namespace std; int Algo,type;

if(abs(dx) >= abs(dy)){

x = x_1 + 0.5 * sign(xin);

int cnt =1;

cout<<"\n x_1_click "<<x_s<<" y_1_click "<<y_s; cout<<"\n

x_2_click "<<x_e<<" y_2_click "<<y_e<<"\n";

if(Algo == 1){ DDA_LINE(x_s,y_s,x_e,y_e,type);

cout<<"\n Select the Algorithm \n 1. DDA \n 2. Bresenham's \n"; cin>>Algo;

#include <math.h> #include

namespace std; float

int Algo; void

void floodFill(int x, int y, float *newCol, float *oldcol){ float

if(oldcol[0]==pixel[0] && oldcol[1]==pixel[1] && oldcol[2]==pixel[2]){

if((color[0]!=bc[0] || color[1]!=bc[1] || color[2]!=bc[2]) &&

void mouse(int btn, int state, int x, int y){ y =

if(btn == GLUT_LEFT_BUTTON && state == GLUT_DOWN){ float bcol[] =

float oldcol[] = {1,1,1};

float newCol[] = {R,G,B};

void B_Draw(){ glClear(GL_COLOR_BUFFER_BIT);

void F_Draw(){ glClear(GL_COLOR_BUFFER_BIT);

void goMenu(int value){

int main(int argc, char** argv){ cout<<"\n \t

Select the Algorithm ";

cout<<"\n \t 1. Boundary Fill Algorithm ";

cout<<"\n \t 2. Flood Fill Algorithm \n \t";

else if(points[i+1][1] < wymax){

for(int i=0; i<k;i++)

using namespace std;

double round(double d){

return floor(d + 0.5);

int tx, ty;

cout<<"\t Enter Tx, Ty \n";

for(int i=0;i<edge;i++){ xpoint[i]

= xpoint[i] + tx; ypoint[i] =

int cx, cy;

cout<<"\n Enter Ar point x , y "; cin

>> cx >> cy;

glColor3f(0.0, 1.0, 0.0);

cout<<"\n Enter thetha ";

the = the * 3.14/180;

glVertex2i(round(((xpoint[i] - cx)*cos(the) - ((ypoint[i]-cy)*sin(the))) + cx),

round(((xpoint[i] - cx)*sin(the) + ((ypoint[i]-cy)*cos(the))) + cy));

cout<<"\n\tIn Scaling whole screen is 1st Qudrant \n"; int

cout<<"\t Enter sx, sy \n";

cin>> sx>> sy;

xpoint[i] = (xpoint[i]-320) * sx;

ypoint[i] = (ypoint[i]-240) * sy;

cout<<"Enter Reflection Axis \n";

if(reflection == 'x' || reflection == 'X'){

glVertex2i(xpoint[i], (ypoint[i] * -1)+480);

else if(reflection == 'y' || reflection == 'Y'){

if(ch==2 || ch==3 || ch==4){

else if(ch == 2){

else if( ch == 3){

else if (ch == 4){

int main(int argc, char** argv){

cout<<"\n \t Enter 1) Scaling ";

cout<<"\n \t Enter 2) Rotation about arbitrary point"; cout<<"\n

cout<<"\n \t Enter 4) Translation \n \t";

if(ch==1 || ch==2 || ch==3 || ch==4){

cout<<"Enter No of edges \n"; cin>>

int xpointnew, ypointnew;

void floodFill(int x, int y, float newCol, float oldcol){ float

glVertex2i(round(((xpoint[i] - cx)cos(the) - ((ypoint[i]-cy)sin(the))) + cx),

round(((xpoint[i] - cx)sin(the) + ((ypoint[i]-cy)cos(the))) + cy));