Bresenham's line algorithm
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in commonly used computer instruction sets such as x86_64. It is an incremental error algorithm, and one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles.
- Comment
- enBresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in commonly used computer instruction sets such as x86_64. It is an incremental error algorithm, and one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles.
- Depiction
- Has abstract
- enBresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in commonly used computer instruction sets such as x86_64. It is an incremental error algorithm, and one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles. While algorithms such as Wu's algorithm are also frequently used in modern computer graphics because they can support antialiasing, Bresenham's line algorithm is still important because of its speed and simplicity. The algorithm is used in hardware such as plotters and in the graphics chips of modern graphics cards. It can also be found in many software graphics libraries. Because the algorithm is very simple, it is often implemented in either the firmware or the graphics hardware of modern graphics cards. The label "Bresenham" is used today for a family of algorithms extending or modifying Bresenham's original algorithm.
- Hypernym
- Algorithm
- Is primary topic of
- Bresenham's line algorithm
- Label
- enBresenham's line algorithm
- Link from a Wikipage to an external page
- www.phatcode.net/res/224/files/html/ch35/35-01.html
- www.pdp8online.com/563/563.shtml
- archive.org/details/michaelabrashsgr00abra/page/654
- archive.org/details/michaelabrashsgr00abra/page/654%7Curl-access=registration
- www.cs.helsinki.fi/group/goa/mallinnus/lines/bresenh.html
- members.chello.at/~easyfilter/bresenham.html
- xlinux.nist.gov/dads/HTML/bresenham.html
- members.chello.at/~easyfilter/Bresenham.pdf%7Cyear=2012
- rosettacode.org/wiki/Bitmap/Bresenham's_line_algorithm
- sites.google.com/site/patrickmaillot/english
- web.archive.org/web/20080528040104/http:/www.research.ibm.com/journal/sj/041/ibmsjIVRIC.pdf
- www.research.ibm.com/journal/sj/041/ibmsjIVRIC.pdf%7Carchive-date=May
- homepages.enterprise.net/murphy/thickline/index.html
- Link from a Wikipage to another Wikipage
- Association for Computing Machinery
- Bitmap image
- Bitwise operation
- Calcomp plotter
- Category:Articles with example pseudocode
- Category:Computer graphics algorithms
- Category:Digital geometry
- Circles
- Computer graphics
- Computer screen
- Digital differential analyzer (graphics algorithm)
- File:Bresenham.svg
- File:Line 1.5x+1.svg
- File:Line 1.5x+1 -- candidates.svg
- File:Line 1.5x+1 -- planes.svg
- File:Line 1.5x+1 -- points.svg
- Firmware
- Graphics card
- Graphics hardware
- Graphics library
- Graphics processing unit
- IBM
- IBM 1401
- Incremental error algorithm
- Instruction set architecture
- Jack Elton Bresenham
- Line drawing algorithm
- Line primitives
- Midpoint circle algorithm
- Octant (plane geometry)
- Pixel center
- Plotter
- Raster graphics
- Slope
- Software
- Spatial anti-aliasing
- Straight line between two points
- Uv mapping
- Voxel
- X86-64
- Xiaolin Wu's line algorithm
- SameAs
- 4k5pk
- Algorithme de tracé de segment de Bresenham
- Algoritma garisan Bresenham
- Algoritmo de Bresenham
- Algoritmo de Bresenham
- Algoritmo de Bresenham
- Algoritmo della linea di Bresenham
- Algorytm Bresenhama
- Bresenham's line algorithm
- Bresenham'ın çizgi algoritması
- Bresenham-Algorithmus
- Bresenham-algoritme
- Bresenhamin algoritmi
- Giải thuật Bresenham vẽ đoạn thẳng
- m.0h4m6
- Q549860
- Алгоритм Брезенхейма
- Алгоритм Брезенхэма
- Алгоритъм на Брезенхам
- Брезенхамов линијски алгоритам
- Բրեզենհեմի ալգորիթմ
- خوارزمية بريزنهام لرسم مستقيم
- ბრეზენჰემის ალგორითმი
- ブレゼンハムのアルゴリズム
- 布雷森漢姆直線演算法
- Subject
- Category:Articles with example pseudocode
- Category:Computer graphics algorithms
- Category:Digital geometry
- Thumbnail
- WasDerivedFrom
- Bresenham's line algorithm?oldid=1124608008&ns=0
- WikiPageLength
- 21988
- Wikipage page ID
- 64005
- Wikipage revision ID
- 1124608008
- WikiPageUsesTemplate
- Template:Cite book
- Template:Cite journal
- Template:Cite news
- Template:Commons category
- Template:ISBN
- Template:Reflist
- Template:Short description
