Digital differential analyzer (graphics algorithm): Difference between revisions

Content deleted Content added
Line 79:
The DDA method can be implemented using [[floating-point]] or [[integer]] arithmetic. The naïve 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 a [[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 ''<code>m''</code> of the interpolated start/end values.
 
DDAs are well-suited for hardware implementation and can get pipelined for maximized throughput.