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.
2014
2014
In this paper, an improved Bresenham algorithm is proposed in order to improve the display effect of the digital instrument… 
2013
2013
Traditional 3D-Bresenham’s algorithm is efficient in generating lines on raster systems using only integer calculations. This… 
2010
2010
When mosaicking two adjacent orthophotos,the tran-sition from one orthophoto to the other is cannot be seen.The requirements of… 
2008
2008
Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham… 
2007
2007
For scan-converting a line, Bresenham’s Line Algorithm is an efficient incremental method. In this paper, we have presented an… 
2004
2004
Structured grids and some of their applications in natural sciences are discussed. The problem of their visualization and… 
2003
2003
A unitary, molded plastic device for holding and displaying a decorative article, such as a plate, from a vertical surface, such… 
2003
2003
  • Lin Li
  • 2003
  • Corpus ID: 124448736
The Bresenham line drawing algorithm has two improved versions, namely symmtery and 2-step algorithm. Combining Symmetry… 
2001
2001
A 3D line segment can be defined with two endpoints, in which Δ x ≥Δ y ≥Δ z 0, and then Bresenham's 2D line algorithm is applied…