Pixel-processing fundamentals
Jack E. Bresenham · IEEE Computer Graphics and Applications · 1996
The key to developing line drawing algorithms is an explicit reference model for quantifying a "good" raster approximation. The article looks at old practices, then demonstrates the development of line and edge drawing algorithms. Computer driven raster displays introduce a higher performance, more demanding technology that benefits from systematic rules. To examine the development of a compact, integer arithmetic algorithm for line rastering, the article looks at some pixel space basics, then considers alternative measures by which closeness to a true line's locus could be evaluated. The key to effective use of all algorithms is a clear understanding of your objective function and the implications that can arise from incomplete or unintentionally fuzzy assumptions.
Cited by 19 works. doi:10.1109/38.481626
Authors
References
- Discrete Representation of Straight Lines
- An algorithmic comparison between square- and hexagonal-based grids
- Accurate rendering by subpixel addressing
- Double-step incremental generation of lines and circles
- Fast line scan-conversion
- Ambiguities in Incremental Line Rastering
- Parallelization of Bresenham's line and circle algorithms
- N-step incremental straight-line algorithms
- Double- and triple-step incremental linear interpolation
- Getting raster ellipses right