19-05-2017, 09:08 AM
The Bresenham Line Algorithm is an algorithm that determines the points of an n-dimensional raster that must be selected to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (for example, on a computer screen), since it uses only integer addition, subtraction, and bit-shifting, all of which are very cheap operations in Computer standard. It is an incremental error algorithm. It is one of the first algorithms developed in the field of graphic computing. An extension of the original algorithm can be used to draw circles.
While algorithms such as the Wu algorithm are also frequently used in modern computer graphics because they can support the antialiasing, speed and simplicity of the Bresenham line algorithm mean that it is still important. The algorithm is used in hardware 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 the firmware or graphics hardware of modern graphics cards. The "Bresenham" tag is used today for a family of algorithms that extend or modify the original Bresenham algorithm.
While algorithms such as the Wu algorithm are also frequently used in modern computer graphics because they can support the antialiasing, speed and simplicity of the Bresenham line algorithm mean that it is still important. The algorithm is used in hardware 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 the firmware or graphics hardware of modern graphics cards. The "Bresenham" tag is used today for a family of algorithms that extend or modify the original Bresenham algorithm.