hello does anyone have any idea about this algorithm? i heard it''s faster than the breshnam algo is it true thanks http://qsoft.cjb.net

I''ve heard it mentioned a couple of times. Here''s a vague
snippet I found in Win32.hlp from Borland C++ Builder...

"digital differential analyzer (DDA)

An algorithm that determines which pixels on a video display (or dots on a printed page) are part of a line or curve. See also pixel."

So it exists, and you know what the acronym stands for,
so you can search (try www.google.com) for it now.

Good luck finding info,

Alistair Keys

P.S. Yeah, the place I heard it first (http://www.azillionmonkeys.com/qed/optimize.html) said a "fixed
point DDA line algorithm" should be used instead of
Bresenham, so it should be faster.

same place i heard of it i guess hehe
well thanks for info