◄ Wiki / Graphics

Bresenham

A classic algorithm that draws a straight line on a pixel grid using only integer addition — no slow division or floating point.

Drawing a line between two points requires deciding which pixels to light up along the way. Bresenham's algorithm tracks an integer error term and steps one pixel at a time, choosing the closest grid position without ever computing fractions. It is fast and exact, which is why it still underpins line rasterization; a stippled variant simply skips pixels in a pattern to produce dashed lines.