Extension to Bresenham's Algorithm for Plotting a Sequence of Straight Lines
Original Publication Date: 1984-Feb-01
Included in the Prior Art Database: 2005-Feb-02
The most convenient algorithm for a drawing engine, operating on a points-addressable device such as a plotter or display, to use for plotting lines is that of Bresenham ("Algorithm for Computer Control of a Digital Plotter," IBM Systems Journal 4 25-30 (1965). This algorithm assumes that the true line passes through the given start and end points, and determines which are the best intermediate points to turn to. A problem can arise, however, if a continuous curve is being drawn by means of a sequence of short lines. In this case, if each line is specified by its start and end points (using a natural co-ordinate system in which one unit = the distance between adjacent display points), then applying Bresenham's algorithm to each line will cause a rather less smooth curve than is possible to be drawn.