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. It is one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
sameAs | |
dbp:wikiPageUsesTemplate | |
Subject | |
Link from a Wikipage to an external page |
|
thumbnail | |
foaf:depiction | |
gold:hypernym | |
prov:wasDerivedFrom | |
Wikipage page ID |
|
page length (characters) of wiki page |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage |
|
has abstract |
|
foaf:isPrimaryTopicOf | |
is Wikipage redirect of | |
is Link from a Wikipage to another Wikipage of |