please like it

1. COMPUTER GRAPHICS
SUBMITTED TO: SUBMITTED BY:
LECT.: ISHANT VATS MUSTKEEM
ADD NO.:14S121
BRANCH: 6 CS.
DIGAMBER JAIN POLYTECHNIC BARAUT BAGHPAT

2. Admission no.: 14S121
Page 1
INTRODUCTION OF Graphics:
Computer graphics are pictures and films created using computers. Usually, the term refers
to computer‐generated image data created with help from specialized graphical hardware
and software. It is a vast and recent area in computer science. The phrase was coined in
1960, by computer graphics researchers Verne Hudson and William Fetter of Boeing. It is
often abbreviated as CG, though sometimes erroneously referred to as CGI.
Important topics in computer graphics include user interface design, sprite graphics, vector
graphics, 3D modelling, shades, GPU design, implicit surface visualization with ray tracing,
and computer vision, among others. The overall methodology depends heavily on the
underlying sciences of geometry, optics, and physics.
Requirements Of Computer Graphics:
Hardware Required:
 IBM‐compatible Pentium pc.
 Minimum of 64 MB RAM.
 A CD‐ROM drive.
 A Hard disk of 2GB or higher.
 A Mouse.
 A Graphics Card.
Software Required:
 Windows 95 and Higher Version.
 Turbo C/C++.
 A Graphics Driver.
 A Graphics Library.

3. Admission no.: 14S121
Page 2
Program 1: WAP in C Implement DDA Algorithm.
#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<math.h>
void dda(float x1,float y1,float x2,float y2)
{
float dx,dy,x=x1,y=y1,m;
int i;
dx=x2-x1;
dy=y2-y1;
if(abs(dx)>=abs(dy))
m=abs(dx);
else
m=abs(dy);
putpixel((int)x,(int)y,15);
for(i=1;i<=m;i++)
{
x=x+dx/m;
y=y+dy/m;
putpixel((int)x,(int)y,15);
}
}
void main()
{
float x1,x2,y1,y2;
int ch;

4. Admission no.: 14S121
Page 3
int gd=DETECT,gm=DETECT;
initgraph(&gd,&gm, "C:TCbgi");
printf("enter end point of line x1 t");
scanf("%f",&x1);
printf("enter end point of line y1 t");
scanf("%f",&y1);
printf("enter end point of line x2 t");
scanf("%f",&x2);
printf("enter end point of line y2 t");
scanf("%f",&y2);
dda(x1,y1,x2,y2);
getch();
closegraph();
}
OUTPUT:

5. Admission no.: 14S121
Page 4
Program 2: WAP in C Implement Bresenham Algorithm.
#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<math.h>
#include<dos.h>
void bress(float x1,float y1,float x2,float y2)
{
int x,y,end,inc=0,p,dx=abs(x2-x1);
int dy=abs(y2-y1),c=0,current=0;
if(dx>dy)
{
p=2*dy-dx;
if(x1<x2)
{
x=x1;
y=y1;
end=x2;
if(y1<y2)inc=1;
if(y1>y2)inc=-1;
}
else
{
x=x2;
y=y2;
end=x1;
if(y2<y1)inc=1;

6. Admission no.: 14S121
Page 5
if(y2>y1)inc=-1;
}
while(x<=end)
{
putpixel(x,y,15);
if(p<0)
p=p+2*dy;
else
{
y=y+inc;
p=p+2*(dy-dx);
}
x++;
if(current==0 && c==10)
{
current=1;
c=-1;
}
if(current==y && c==6)
{
current=0;
c=-1;
}
c++;
}
}
else

7. Admission no.: 14S121
Page 6
{
p=2*dx-dy;
if(y1<y2)
{
y=y1;
x=x1;
end=y2;
if(x1<x2)inc=1;
if(x1>x2)inc=-1;
}
else
{
y=y2;
x=x2;
end=y1;
if(x2<x1)inc=1;
if(x2>x2)inc=-1;
}
while(y<=end)
{
putpixel(x,y,15);
if(p<0)p=p+2*dx;
else
{
x=x+inc;
p=p+2*(dx-dy);
}

8. Admission no.: 14S121
Page 7
y++;
if(current==0 && c==10)
{
current=1;c=-1;
}
if(current==1 && c==6)
{
current=0;c=-1;
}
c++;
}
}
}
void main()
{
float x1,x2,y1,y2;
int gd=DETECT,gm=DETECT;
initgraph(&gd,&gm, "C:TCbgi");
printf("enter end point of line x1 t");
scanf("%f",&x1);
printf("enter end point of line y1 t");
scanf("%f",&y1);
printf("enter end point of line x2 t");
scanf("%f",&x2);
printf("enter end point of line y2 t");
scanf("%f",&y2);
bress(x1,y1,x2,y2);

9. Admission no.: 14S121
Page 8
getch();
closegraph();
}
OUTPUT:

10. Admission no.: 14S121
Page 9
Program 3: WAP in C Implement A Scaling.
#include<stdio.h>
#include<graphics.h>
#include<conio.h>
void draw2d(int,int [],int [],int,int);
void main()
{
int gd=DETECT,gm;
int x[20],y[20],tx=0,ty=0,i,fs;
int mx,my;
initgraph(&gd,&gm,"C:Turboc3BGI");
printf("nNo of sides : ");
scanf("%d",&fs);
printf("Co-ordinates : ");
for(i=0;i<fs;i++)
{
printf("(x%d,y%d)",i,i);
scanf("%d%d",&x[i],&y[i]);
}
draw2d(fs,x,y,tx,ty);
printf("Magnification (x,y) : ");
scanf("%d%d",&mx,&my);
for(i=0;i<fs;i++)
{
x[i]=x[i]*mx;
y[i]=y[i]*my;
}

11. Admission no.: 14S121
Page 10
draw2d(fs,x,y,tx,ty);
}
getch();
}
void draw2d(int fs,int x[20],int y[20],int tx,int ty)
{
int i;
for(i=0;i<fs;i++)
{
if(i!=(fs-1))
line(x[i]+tx,y[i]+ty,x[i+1]+tx,y[i+1]+ty);
else
line(x[i]+tx,y[i]+ty,x[0]+tx,y[0]+ty);
}
}
OUTPUT:

12. Admission no.: 14S121
Page 11
Program 4: WAP in C Implement A Rotation.
# include <stdio.h>
# include <conio.h>
# include <graphics.h>
# include <math.h>
void main()
{
int x1,y1,x2,y2,gd=DETECT,gm,t;
clrscr();
initgraph(&gd,&gm,"C:TCBGI");
printf("nEnter the co-ordinates of first point : ");
scanf("%d %d",&x1,&y1);
printf("nEnter the co-ordinates of second point : ");
scanf("%d %d",&x2,&y2);
printf("nEnter rotational angle t: ");
scanf("%d",&t);
printf("nInitial line is:");
line(x1,y1,x2,y2);
x2=x2*(cos(t))-y2*(sin(t));
y2=x2*(sin(t))+y2*(cos(t));
printf("nRotated line is: ");
line(x1,y1,x2,y2);
getch();
closegraph();
}

13. Admission no.: 14S121
Page 12
OUTPUT:

14. Admission no.: 14S121
Page 13
Program 5: WAP in C Implement A Translation.
# include <stdio.h>
# include <conio.h>
# include <graphics.h>
void main()
{
int x1,y1,x2,y2,gd=DETECT,gm,tx,ty;
clrscr();
initgraph(&gd,&gm,"C:TCBGI");
printf("nEnter the co-ordinates of first point : ");
scanf("%d %d",&x1,&y1);
printf("nEnter the co-ordinates of second point : ");
scanf("%d %d",&x2,&y2);
printf("nEnter translational index tx and ty: ");
scanf("%d%d",&tx,&ty);
printf("nInitial line is:");
line(x1,y1,x2,y2);
x1=x1+tx;
y1=y1+ty;
x2=x2+tx;
y2=y2+ty;
printf("nTranslated line is: ");
line(x1,y1,x2,y2);
getch();
closegraph();
}

15. Admission no.: 14S121
Page 14
OUTPUT: