Skip to search formSkip to main contentSkip to account menu

Bresenham's line algorithm

Known as: Bresenhams line algorithm, Bresenham's Algorithm, Bresenham line 
Bresenham's line algorithm is an algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham… 
2004
2004
Many of commercially available circuits for CNC machines have digitized input so there is a need to map continuous motions onto… 
1996
Highly Cited
1994
Highly Cited
1994
  • E. Andres
  • Computers & graphics
  • 1994
  • Corpus ID: 32949823
1991
1991
The line segment is the basic entity in virtually all computer graphics systems. J.E. Bresenham's algorithm (1965) efficiently… 
Highly Cited
1991
Highly Cited
1991
Highly Cited
1990
Highly Cited
1990
  • W. E. Wright
  • IEEE Computer Graphics and Applications
  • 1990
  • Corpus ID: 206426742
Parallel algorithm for line and circle drawing that are based on J.E. Bresenham's line and circle algorithms (see Commun. ACM… 
1982
1982
Bresenham's algorithm is well known as an efficient and elegant control program for drawing a best fit approximation to straight…