Comparative analysis of DDA algorithm and Bresenham algorithm Online publication date: Mon, 20-Feb-2023
by Ya-xin Zhang; Kang-ru Zhang; Chuan-hao Wu; Gui-ping Ge; Yong-an Xu
International Journal of Intelligent Internet of Things Computing (IJIITC), Vol. 1, No. 4, 2022
Abstract: The straight line segment is the basic graphic element, and its generation algorithm has a great influence on the generation speed of complex graphics. In the past, the efficiency of integer operation is higher than that of floating-point operation, and the complexity of DDA algorithm is mainly floating-point addition and rounding operation, and the complexity of Bresenham algorithm is mainly integer operation through further improvement. Therefore, it is clearly explained in the existing computer graphics textbooks that the efficiency of Bresenham algorithm is higher than that of DDA algorithm. Through experiments, endpoints of 1,000 to 10,000 straight line segments are randomly generated, and the runtime of Bresenham algorithm and DDA algorithm is compared. It is found that the efficiency of DDA algorithm is higher than that of Bresenham algorithm. Then, by combining the comparison of the efficiency of modern CPU for addition, multiplication and division of integer and floating point with the improvement of floating-point computing hardware and instruction set in modern CPU, the computer's floating-point computing capabilities have been greatly improved, thus making the DDA algorithm more efficient than the Bresenham algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Internet of Things Computing (IJIITC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com