How did Bresenham represented pixel grids to derive his line drawing algorithm?
I am seeking for a succinct source regarding how did Bresenham's imagined the pixel grids. Because different APIs have different implementations of pixel grid. Without the fundamental understanding of a pixel grid, it is impossible to understand the derivation of line drawing algorithm and circle drawing algorithm. I hope to get some valuable input from hackers.
Bresenham’s paper is online at https://dl.acm.org/doi/10.1145/280811.280913.
It has 6 pages. Is that succinct enough?
Also, as dfranks says, it was developed for plotters, so he didn’t think of pixels.
Thank you. One question, what is it we are trying to plot? The entire square? Or just the small circle?
It was apparently developed for drawing lines on pen plotters. Pen plotters use either stepper motors or servo motors with encoders. In the simplest case, stepper motors, one of the steppers is the major axis and is instructed to step for each new "pixel". The other motor is the minor axis and only steps when the fractional add overflows into the integer portion of the coordinate.
So, pen plotters effectively have "pixels" as defined by the stepper or encoder positions of the motors.