bresenham算法

算法"/>

bresenham算法

bresenham算法

Bresenham's algorithm was proposed to overcome the drawbacks of the DDA algorithm. First, let us see what the drawbacks of DDA algorithm were,

提出了Bresenham算法以克服DDA算法的缺点。 首先，让我们看看DDA算法的缺点是什么，

Drawbacks of DDA algorithm:

DDA算法的缺点：

The only drawback of the DDA algorithm was that it produces floating-point results which reduces the overall complexity. This problem was solved by Bresenham's line drawing algorithm.

DDA算法的唯一缺点是它会产生浮点结果，从而降低了总体复杂度。 Bresenham的线条绘制算法解决了这个问题。

布雷森汉姆算法简介 (Introduction to Bresenham's Algorithm)

Bresenham's line drawing algorithm is a second method of generating a line that was proposed after the DDA algorithm to overcome its limitations and drawbacks. It was developed by J.E. Bresenham in 1962. This algorithm is used for calculating intermediate coordinate points between the given source and ending points by only using integer addition and subtraction.

布雷森汉姆(Bresenham)的线条绘制算法是生成线条的第二种方法，该方法是DDA算法之后提出的，用于克服其局限性和缺点。 它由JE Bresenham在1962年开发。此算法仅通过使用整数加法和减法来计算给定源和终点之间的中间坐标点。

This algorithm determines the points which should be selected to form a close approximation to a line between two points.

该算法确定应选择的点以形成与两点之间的直线的近似值。

It is also an incremental method for creating a line.

这也是创建线的一种增量方法。

It is faster than the DDA algorithm as it does not involves the use of heavy operations such as multiplication and division.

它比DDA算法更快，因为它不涉及繁重的运算，例如乘法和除法。

Bresenham算法的工作 (Working of the Bresenham's Algorithm)

Suppose we have to draw a line PQ with coordinates P (x1, y1) and Q (x2, y2).

假设我们必须绘制一条坐标为P(x1，y1)和Q(x2，y2)的直线PQ 。

To draw the line using Breshenam's line drawing algorithm, first of all, calculate th