Advantages of DDA line drawing algorithm?

Answer 1

DDA Line Drawing Algorithm

Step 1:[Determine The Dx & Dy]

Dx=Xb-Xa

Dy=Yb-Ya

Step 2:[Determine Slope is Gentle or Sharp]

If |Dx|>|Dy| then

Gentle Slope

M=Dy/Dx

Set The Starting Point

If Dx>0 Then

C=CELING(Xb)

D=Yb+M*(C-Xb)

F=FLOOR(Xa)

R=FLOOR(D+0.5)

H=R-D+M

IF M>0 Then

Positive Gentle Slope

M1=M-1

Now Step Through The Columns

WHILE C<=F

C Programming Coding For DDA Algorithm
void linedda(int xa,int ya,int xb,int yb) {

int dx=xb-xa,dy=yb-ya,steps,k;
float xincrement,yincrement,x=xa,y=ya;

if(abs(dx)>abs(dy)) steps=abs(dx);
else steps=abs(dy);

xincrement=dx/(float)steps;
yincrement=dy/(float)steps;

putpixel(round(x),round(y),2)

for(k=0;kx+=xincrement;
y+=yincrement;
putpixel(round(x),round(y),2);
}
}
More Informationhttp://knol.Google.com/k/thiyagaraaj-m/dda-line-algorithm/1lfp8o9xxpx13/78#
http://i.thiyagaraaj.com/articles/articles/dda-line-algorithm

Answer 2

DDA IS digital differential analyzer.

It is a line drawing algorithm. i.e., this algorithm is used to draw a line between two given points (ex. (x1,y1) & (x2,y2)).

numerical explanation-

y=mx+c .... (equation of a line).

hence, c=y-mx

m=((y2-y1)/(x2-x1)) => m=dy/dx; => dy=m*dx OR dx=dy/m;

now take mod of slope,

if |m|<=1,

then take dx = 1; (here dx = difference between two consecutive points on x-axis).

calculatinf points for y-cordinate.

y3=y1+m*dx

y4=y3+m*dx

y5=y4+m*dx..

..... ....... ....

...............

yn=yn-1+m*dx

hence , you are getting points which will lead u to the point y2 and x2.

else if |m|>1,

then take dy =1;

and calculate points for x-cordinate.

x3=x1+(dy/m);

x4=x3+(dy/m);

.... ...... .....

have fun guyz... :)

Answer 3

C Programming Coding For DDA Algorithmvoid linedda(int xa,int ya,int xb,int yb) {

int dx=xb-xa,dy=yb-ya,steps,k;
float xincrement,yincrement,x=xa,y=ya;

if(abs(dx)>abs(dy)) steps=abs(dx);
else steps=abs(dy);

xincrement=dx/(float)steps;
yincrement=dy/(float)steps;

putpixel(round(x),round(y),2)

for(k=0;kx+=xincrement;
y+=yincrement;
putpixel(round(x),round(y),2);
}
}
More Informationhttp://knol.google.com/k/thiyagaraaj-m/dda-line-algorithm/1lfp8o9xxpx13/78#
http://i.thiyagaraaj.com/articles/articles/dda-line-algorithm

Answer 4

Advantages of DDA Algorithm:

1. It is the simplest algorithm and it does not require special skills for implementation.

2. It is a faster method for calculating pixel positions than the direct use of equation y=mx + b. It eliminates the multiplication in the equation by making use of raster characteristics, so that appropriate increments are applied in the x or y direction to find the pixel positions along the line path.

Answer 5

DDA is one of the algorithms used to draw lines via linear interpolation of variables in computer graphics. DDA stands for Digital Differential Analyzer.