DDA Algorithm
DDA stands for Digital Differential Analyzer. It is an incremental method of scan
conversion of line. In this method calculation is performed at each step but by
using results of previous steps.
Suppose at step i, the pixels is (xi,yi)
The line of equation for step i
yi=mxi+b......................equation 1
Next value will be
yi+1=mxi+1+b.................equation 2
m =DDA Algorithm
yi+1-yi=∆y.......................equation 3
yi+1-xi=∆x......................equation 4
yi+1=yi+∆y
∆y=m∆x
yi+1=yi+m∆x
∆x=∆y/m
xi+1=xi+∆x
xi+1=xi+∆y/m
Case1: When |M|<1 then (assume that x12)
x= x1,y=y1 set ∆x=1
yi+1=y1+m, x=x+1
Until x = x2
Case2: When |M|<1 then (assume that y12)
x= x1,y=y1 set ∆y=1
xi+1=DDA Algorithm, y=y+1
Until y → y2
Advantage:
It is a faster method than method of using direct use of line equation.
This method does not use multiplication theorem.
It allows us to detect the change in the value of x and y ,so plotting of same
point twice is not possible.
This method gives overflow indication when a point is repositioned.
It is an easy method because each step involves just two additions.
Disadvantage:
It involves floating point additions rounding off is done. Accumulations of round
off error cause accumulation of error.
Rounding off operations and floating point operations consumes a lot of time.
It is more suitable for generating line using the software. But it is less suited
for hardware implementation.
DDA Algorithm:
Step1: Start Algorithm
Step2: Declare x1,y1,x2,y2,dx,dy,x,y as integer variables.
Step3: Enter value of x1,y1,x2,y2.
Step4: Calculate dx = x2-x1
Step5: Calculate dy = y2-y1
Step6: If ABS (dx) > ABS (dy)
Then step = abs (dx)
Else
Step7: xinc=dx/step
yinc=dy/step
assign x = x1
assign y = y1
Step8: Set pixel (x, y)
Step9: x = x + xinc
y = y + yinc
Set pixels (Round (x), Round (y))
Step10: Repeat step 9 until x = x2
Step11: End Algorithm
Example: If a line is drawn from (2, 3) to (6, 15) with use of DDA. How many points
will needed to generate such line?
Solution: P1 (2,3) P11 (6,15)
x1=2
y1=3
x2= 6
y2=15
dx = 6 - 2 = 4
dy = 15 - 3 = 12
m = DDA Algorithm
For calculating next value of x takes x = x + DDA Algorithm
DDA Algorithm
DDA Algorithm
Program to implement DDA Line Drawing Algorithm:
#include<graphics.h>
#include<conio.h>
#include<stdio.h>
void main()
{
intgd = DETECT ,gm, i;
float x, y,dx,dy,steps;
int x0, x1, y0, y1;
initgraph(&gd, &gm, "C:\\TC\\BGI");
setbkcolor(WHITE);
x0 = 100 , y0 = 200, x1 = 500, y1 = 300;
dx = (float)(x1 - x0);
dy = (float)(y1 - y0);
if(dx>=dy)
{
steps = dx;
}
else
{
steps = dy;
}
dx = dx/steps;
dy = dy/steps;
x = x0;
y = y0;
i = 1;
while(i<= steps)
{
putpixel(x, y, RED);
x += dx;
y += dy;
i=i+1;
}
getch();
closegraph();
}
Output:
DDA Algorithm
Symmetrical DDA:
The Digital Differential Analyzer (DDA) generates lines from their differential
equations. The equation of a straight line is
DDA Algorithm
The DDA works on the principle that we simultaneously increment x and y by small
steps proportional to the first derivatives of x and y. In this case of a straight
line, the first derivatives are constant and are proportional to ∆x and ∆y .
Therefore, we could generate a line by incrementing x and y by ϵ ∆x and ϵ ∆y, where
ϵ is some small quantity. There are two ways to generate points
1. By rounding to the nearest integer after each incremental step, after rounding
we display dots at the resultant x and y.
2. An alternative to rounding the use of arithmetic overflow: x and y are kept in
registers that have two parts, integer and fractional. The incrementing values,
which are both less than unity, are repeatedly added to the fractional parts and
whenever the results overflows, the corresponding integer part is incremented. The
integer parts of the x and y registers are used in plotting the line. In the case
of the symmetrical DDA, we choose ε=2-n,where 2n-1≤max (|∆x|,|∆y|)<2π
A line drawn with the symmetrical DDA is shown in fig:
DDA Algorithm
Example: If a line is drawn from (0, 0) to (10, 5) with a symmetrical DDA
1. How many iterations are performed?
2. How many different points will be generated?
Solutions: Given: P1 (0,0) P2 (10,5)
x1=0
y1=0
x2=10
y2=5
dx = 10 - 0 = 10
dy = 5 - 0 = 0
DDA Algorithm
P1 (0,0) will be considered starting points
P3 (1,0.5) point not plotted
P4 (2, 1) point plotted
P5 (3, 1.5) point not plotted
P6 (4,2) point plotted
P7 (5,2.5) point not plotted
P8 (6,3) point plotted
P9 (7,3.5) point not plotted
P10 (8, 4) point plotted
P11 (9,4.5) point not plotted
P12 (10,5) point plotted
Following Figure show line plotted using these points.
DDA Algorithm
Next TopicBresenham's Line Algorithm
← prevnext →
Help Others, Please Share
facebook twitter pinterest
Learn Latest Tutorials
Arduino tutorial
Arduino
Digital Electronics tutorial
Digital E.
Google Adwords tutorial
Adwords
MySQL tutorial
MySQL
Python tutorial
Python
smartsheet
Smartsheet
affiliate marketing
Affiliate M.
Software Testing Tutorial
Testing
Proc*C
Proc*C
social media marketing
SMM
GDB
GDB
Fuzzy Logic
Fuzzy Logic
Preparation
Aptitude
Aptitude
Logical Reasoning
Reasoning
Verbal Ability
Verbal A.
Interview Questions
Interview
Company Interview Questions
Company
