To draw a line, you need two points between which you can draw a line. The Bresenham algorithm is another incremental scan conversion algorithm. The big . E Claridge, School of Computer Science, The University of Birmingham. DERIVATION OF THE BRESENHAM’S LINE ALGORITHM. Assumptions: ○ input: line. The basic ”line drawing” algorithm used in computer graphics is Bresenham’s example, in which we wish to draw a line from (0,0) to (5,3) in device space.

Author: | Mezikasa Daigis |

Country: | Equatorial Guinea |

Language: | English (Spanish) |

Genre: | Literature |

Published (Last): | 22 October 2008 |

Pages: | 464 |

PDF File Size: | 18.7 Mb |

ePub File Size: | 13.6 Mb |

ISBN: | 358-2-41954-507-8 |

Downloads: | 70513 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Grorisar |

If the intersection point Q is closest to the point N then N is considered as the next point; otherwise E.

However, as mentioned above this is only for octant zero, that is lines starting at the origin with a gradient between 0 and 1 where x increases by exactly 1 per iteration and y increases by 0 or 1. The Bresenham algorithm is another incremental scan conversion algorithm. The result of this plot is shown to the right. Programs in those days were freely exchanged among corporations so Calcomp Jim Newland and Calvin Hefte had copies. If the intersection point Q of the line with the vertical line connecting E and N is below M, then take E as the next point; otherwise take N as the next point.

To answer this, evaluate the line function at the midpoint between these two points:.

In other projects Wikimedia Commons. If it is closer to the former then include the former point on the line, if the latter then the latter. While algorithms such as Wu’s algorithm are also frequently used in modern computer graphics because drading can support antialiasingthe speed and simplicity of Bresenham’s line algorithm means that it is still important.

## Bresenham’s line algorithm

Because the algorithm is very simple, it is often implemented in either the firmware or the graphics hardware of modern graphics cards. In the following pseudocode sample plot x,y plots the pixel centered at coordinates x,y and abs returns absolute value:. By switching the x and y axis an implementation for positive or negative steep gradients can be written as. Views Read Edit View history. The voxel heightmap software-rendering engines seen breesnham some PC games also used this principle.

A Calcomp plotter drawinng been attached to an IBM via the typewriter console. To draw a line, you breaenham two points between which you can draw a line. It can also be found in many software graphics libraries.

This observation is crucial to understand! A description of the line drawing routine was accepted for presentation at the ACM national convention in Denver, Colorado.

### Bresenham’s line algorithm – Wikipedia

Digital Differential Analyzer DDA algorithm is the simple line generation algorithm which is explained step by step here. For example, as shown in the following illustration, from position 2, 3 you need to choose between 3, 3 and 3, 4. The Bresenham algorithm can be interpreted bresehham slightly modified digital differential analyzer using 0. The algorithm can be extended to cover gradients between 0 and -1 by checking whether y needs to increase or decrease i.

Bresenham’s algorithm chooses the integer y corresponding to the pixel center that is closest to the ideal fractional y for the same x ; on successive columns y can remain the same or increase by 1.

Unsourced material may be challenged and removed.

The label “Bresenham” is used today for a family of algorithms drawig or modifying Bresenham’s original algorithm. It is an incremental error algorithm. The general equation of the line through the endpoints is given by:. This is a function of only x and it would be useful to make this equation written as a function of both x and y.

## Line Generation Algorithm

The adjacent image shows the blue point 2,2 chosen to be on the line with two candidate points in green 3,2 and 3,3. In low level implementation which access the video memory directly it would be typical for the special cases of vertical and horizontal lines to be handled separately as they can be highly optimised.

It is commonly used to draw line primitives in a bitmap image e. The algorithm is used in hardware such lagorithm plotters and in the graphics chips of modern graphics cards.

Please help improve agorithm article by adding citations to reliable sources. In Bresenham wrote: A line splits a plane into halves and the half-plane that has a negative f x,y can be called the negative half-plane, and the other half can be called the positive half-plane. You can use these to make a simple decision about which pixel is closer to the mathematical line.

Retrieved 20 December This observation is very important in the remainder of the derivation. If the error becomes greater than 0.