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.
2018
2018
Advanced Driver Assistance Systems (ADASs), such as autonomous driving, require the continuous computation and update of detailed… 
Review
2017
Review
2017
A computer display monitor, usually called simply a monitor, is a piece of electrical equipment which displays viewable images… 
2014
2014
Los sistemas de codificacion a doble tono multifrecuencial DTMF utilizados en gran parte sobre la comunicacion celular movil, nos… 
2010
2010
When mosaicking two adjacent orthophotos,the tran-sition from one orthophoto to the other is cannot be seen.The requirements of… 
2009
2009
This paper addresses the problem of rectangular hexagonal mesh generation for surface modeling. Hexagonal grids are important for… 
2008
2008
Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham… 
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… 
1982
1982
Bresenham's algorithm is well known as an efficient and elegant control program for drawing a best fit approximation to straight…