2D Drawing Algorithm

The DDA method can be implemented using floating-point or integer arithmetic. The native floating-point implementation requires one addition and one rounding operation per interpolated value (e.g. coordinate x, y, depth, color component etc.) and output result. This process is only efficient when an FPU with fast add and rounding operation is available.

The fixed-point integer operation requires two additions per output cycle, and in case of fractional part overflow, one additional increment and subtraction. The probability of fractional part overflows is proportional to the ratio m of the interpolated start/end values.

DDAs are well suited for hardware implementation and can be pipelined for maximized throughput.

where m represents the slope the line and c is the y intercept . this slope can be expressed in DDA as

m = \frac{y_{end} -y_{start}}{x_{end}-x_{start}}

in fact any two consecutive point(x,y) laying on this line segment should satisfy the equation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .