Translate

Monday, May 11, 2020

Using line digital diffrential analyzer algorithms.

Aim: Write a program line Using Digital Diffrential Analyzer Algorithms.


Source Code:

#include<graphics.h>
#include<iostream.h>
#include<coino.h>
#include<math.h>
void dda(int x1,int y1,int x2 ,int y2);//Function prototype
void main()
{
int x1,x2,y1,y2;
int gd=DETECT,gm;
initgraph(&gd,&gm,"C//TURBOC3//BGI");
Cleardevice();
//Step 1
cout<<"DDA Line Gerneration Algorithm");
cout<<"/n  Enter the Starting co-ordinates of a line :");
cin>>x1>>y1;
cout<<"/n  Enter the Ending co-ordinates of a line :");
cin>>x2>>y2;
dda(x1,y1,x2,y2);//Function call
getch();
closegraph();
}
void dda(int x1,int y1,int x2,int y2)
{
int dx,dy,len,i;
float xinc,yinc,x,y;
dx=x2-x1;
dy=y2-y1;
if(abs(dx)>=abs(dy))
{
len=dx;
}
else
{
len=dy;
}
xinc=(float)dx/len;
yinc=(float)dy/len;
x=x1;
y=y1;
putpixel(x,y,WHITE);
for(i=1;i<=len;i++)
{
x=x+xinc;
y=y+yinc;
x1=x+0.5;
y1=y+0.5;
putpixel(x1,y1,WHITE):
}
}

Output:


YOUTUBE VIDEO:







No comments:

Post a Comment

Bresenhanse Line Darwing Algorithm