Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Hand based biometrie authentication is becoming so popular in the field of information security because it is an accurate and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2014
Review
2014
As today's standard screening methods frequently fail to detect breast cancer before metastases have developed, early diagnosis… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
2013
2013
In this paper we provide an analytical description of various classes of digital circles, spheres and in some cases hyperspheres… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
Bresenham algorithm is the most fundamental algorithm for drawing line segments in computer graphics. Canonical Bresenham… Expand
2005
2005
  • S. Pham
  • The Visual Computer
  • 2005
  • Corpus ID: 22026503
Digitization of a real circle is defined as the set of closest pixels (integer lattice points) to the circle. These pixels form a… Expand
  • figure 2
  • figure 3
  • table 1
  • figure 4
  • figure 5
2004
2004
Many of commercially available circuits for CNC machines have digitized input so there is a need to map continuous motions onto… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1994
Highly Cited
1994
  • E. Andres
  • Comput. Graph.
  • 1994
  • Corpus ID: 32949823
Abstract This paper presents a new approach to discrete circles, rings, and an immediate extension to spheres. The circle, called… Expand
1991
1991
The line segment is the basic entity in virtually all computer graphics systems. J.E. Bresenham's algorithm (1965) efficiently… Expand
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… Expand
  • figure 1
  • figure 2
1982
1982
Bresenham's algorithm is well known as an efficient and elegant control program for drawing a best fit approximation to straight… Expand
  • figure 1