What is recorded here?
Bresenham described a compact integer-update algorithm that selects adjacent plotter-grid points to follow a straight line between integer-coordinate endpoints, handling all eight octants without per-step multiplication or division. A digital plotter can move from a grid point to one of eight neighboring points. To draw a straight segment, it must repeatedly choose which neighbor stays closest to the intended line. Bresenham replaced repeated geometric calculations with a signed integer decision value: in a normalized shallow octant it starts at twice the vertical change minus the horizontal change, then changes only by additions after each horizontal or diagonal move. The paper derives the recurrence and supplies an octant-selection table. Its historical implementation reports 333 IBM1401 core locations and about1.5milliseconds per increment; these are contemporary measurements, not modern performance tests. The article acknowledges a functionally similar1963 algorithm by F.G.Stockton, so it is not presented here as the first integer plotting method. The claim assumes integer grid endpoints and a straight segment. Approximating a curved dataset additionally requires suitably chosen sample points. Tie conventions matter: reversing the endpoints can select a different equally close pixel. This discrete plotting contribution does not provide antialiasing, a guarantee for arbitrary curves, or ownership of later raster-graphics algorithms.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The target is integer-grid plotting of straight segments with the specified nearest-grid decision and tie conventions. Endpoint ordering and half-grid ties can affect reversal symmetry. Finite examples do not establish a universal rasterization theorem, subpixel antialiasing or performance for arbitrary curves. The original device assumptions and later generalized algorithms remain distinct.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
J. E. Bresenham
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Bresenham: drawing straight lines with integer decisions
Bresenham described a compact integer-update algorithm that selects adjacent plotter-grid points to follow a straight line between integer-coordinate endpoints, handling all eight octants without per-step multiplication or division.
A digital plotter can move from a grid point to one of eight neighboring points. To draw a straight segment, it must repeatedly choose which neighbor stays closest to the intended line. Bresenham replaced repeated geometric calculations with a signed integer decision value: in a normalized shallow octant it starts at twice the vertical change minus the horizontal change, then changes only by additions after each horizontal or diagonal move. The paper derives the recurrence and supplies an octant-selection table. Its historical implementation reports 333 IBM1401 core locations and about1.5milliseconds per increment; these are contemporary measurements, not modern performance tests. The article acknowledges a functionally similar1963 algorithm by F.G.Stockton, so it is not presented here as the first integer plotting method. The claim assumes integer grid endpoints and a straight segment. Approximating a curved dataset additionally requires suitably chosen sample points. Tie conventions matter: reversing the endpoints can select a different equally close pixel. This discrete plotting contribution does not provide antialiasing, a guarantee for arbitrary curves, or ownership of later raster-graphics algorithms.
Scientific scope
The target is integer-grid plotting of straight segments with the specified nearest-grid decision and tie conventions. Endpoint ordering and half-grid ties can affect reversal symmetry. Finite examples do not establish a universal rasterization theorem, subpixel antialiasing or performance for arbitrary curves. The original device assumptions and later generalized algorithms remain distinct.
People and systems
J. E. Bresenham