Search results
Results from the WOW.Com Content Network
Bresenham's line algorithm is named after Jack Elton Bresenham who developed it in 1962 at IBM. In 2001 Bresenham wrote: [1] I was working in the computation lab at IBM's San Jose development lab. A Calcomp plotter had been attached to an IBM 1401 via the 1407 typewriter console. [The algorithm] was in production use by summer 1962, possibly a ...
In computer graphics, a line drawing algorithm is an algorithm for approximating a line segment on discrete graphical media, such as pixel-based displays and printers. On such media, line drawing requires an approximation (in nontrivial cases). Basic algorithms rasterize lines in one color.
A naive approach to anti-aliasing the line would take an extremely long time. Wu's algorithm is comparatively fast, but is still slower than Bresenham's algorithm. The algorithm consists of drawing pairs of pixels straddling the line, each coloured according to its distance from the line. Pixels at the line ends are handled separately.
A circle of radius 23 drawn by the Bresenham algorithm. In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It is a generalization of Bresenham's line algorithm. The algorithm can be further generalized to conic sections. [1] [2] [3]
2. In my opinion the animated image that is a screen capture of someone's unique implementation of Bresenham's line algorithm is unhelpful. 3. The method to generalize the algorithm to all 8 octants can be simplified and presented more clearly. 72.229.111.192 20:30, 24 May 2017 (UTC) Regarding point 1: It's still wrong.
Bresenham's line algorithm, developed in 1962, is his most well-known innovation. It determines which points on a 2-dimensional raster should be plotted in order to form a straight line between two given points, and is commonly used to draw lines on a computer screen.
Jack Elton Bresenham – created Bresenham's line algorithm; Dan Bricklin – cocreated VisiCalc, the first personal spreadsheet program; Walter Bright – Digital Mars, First C++ compiler, authored D (programming language) Sergey Brin – cofounded Google Inc.
1962 – Bresenham's line algorithm developed by Jack E. Bresenham; 1962 – Gale–Shapley 'stable-marriage' algorithm developed by David Gale and Lloyd Shapley; 1964 – Heapsort developed by J. W. J. Williams; 1964 – multigrid methods first proposed by R. P. Fedorenko; 1965 – Cooley–Tukey algorithm rediscovered by James Cooley and John ...