Bresenham's Line Algorithm

Bresenham's line algorithm is a line drawing algorithm that determines which points of a raster should be selected to form a close approximation of a straight line between two given points. It is commonly used to draw line primitives in a bitmap image because it relies only on integer addition, subtraction and bit shifting, operations that have historically been very cheap on common computer hardware. It is an incremental error algorithm and one of the earliest algorithms developed in the field of computer graphics; an extension of it, the midpoint circle algorithm, is used for drawing circles.