Fundamentals of interactive computer graphics
Fundamentals of interactive computer graphics
A fast shaded-polygon renderer
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Graphics gems IV
Using program transformations to derive line-drawing algorithms
ACM Transactions on Graphics (TOG)
Algorithm 162: XYmove plotting
Communications of the ACM
A Simple Approach to Digital Signal Processing
A Simple Approach to Digital Signal Processing
Computer Graphics and Geometric Modeling
Computer Graphics and Geometric Modeling
Accurate Rendering by Subpixel Addressing
IEEE Computer Graphics and Applications
Speeding Up Bresenham's Algorithm
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
This algorithm draws straight lines on discrete devices as if they were staircases. It determines the fractional average length of each step, and it fills the pixels along every scanline intersected by the line to be drawn. This algorithm supports fractional line ends, and it uses internal 32-bit fixed-point arithmetic; 16 bits for the integer and 16 bits for the decimal part.