Bresenham's Line Algorithm
The Bresenham line algorithm is an algorithm which determines which points in an n-dimensional raster should be plotted in order to form a close approximation to a straight line between two given points. It is commonly used to draw lines on a computer screen, as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in standard computer architectures. It is one of the earliest algorithms developed in the field of computer graphics. A minor extension to the original algorithm also deals with drawing circles.
While algorithms such as Wu's algorithm are also frequently used in modern computer graphics because they can support antialiasing, the speed and simplicity of Bresenham's line algorithm means that it is still important. The algorithm is used in hardware such as plotters and in the graphics chips of modern graphics cards. It can also be found in many software graphics libraries. Because the algorithm is very simple, it is often implemented in either the firmware or the graphics hardware of modern graphics cards.
The label "Bresenham" is used today for a whole family of algorithms extending or modifying Bresenham's original algorithm. See further references below.
Read more about Bresenham's Line Algorithm: History, The Algorithm, Derivation, Similar Algorithms
Famous quotes containing the word line:
“As for conforming outwardly, and living your own life inwardly, I do not think much of that. Let not your right hand know what your left hand does in that line of business. It will prove a failure.... It is a greater strain than any soul can long endure. When you get God to pulling one way, and the devil the other, each having his feet well braced,—to say nothing of the conscience sawing transversely,—almost any timber will give way.”
—Henry David Thoreau (1817–1862)