Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.


dda line algorithm

This topic is 6386 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

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

Share this post

Link to post
Share on other sites
Guest Anonymous Poster
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.

Share this post

Link to post
Share on other sites

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!