0% found this document useful (0 votes)
52 views11 pages

Bresenham Line Algo

The document discusses Bresenham's line algorithm, which is a line drawing algorithm used to draw lines on bitmap images using only integer math. It is one of the earliest computer graphics algorithms developed and remains important due to its simplicity and speed. The algorithm attempts to determine the points of a raster line that best approximate a straight line between two points.

Uploaded by

Geetansh Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views11 pages

Bresenham Line Algo

The document discusses Bresenham's line algorithm, which is a line drawing algorithm used to draw lines on bitmap images using only integer math. It is one of the earliest computer graphics algorithms developed and remains important due to its simplicity and speed. The algorithm attempts to determine the points of a raster line that best approximate a straight line between two points.

Uploaded by

Geetansh Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

 

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
standard computer architectures. 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.
While algorithms such as Wu's algorithm are also frequently used in modern
computer graphics because they can support antialiasing, the speed and
simplicity of Bresenham's line algorithm means that it is still important. The
algorithm is used in hardware such as plotters. 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.
Bresenham Line Drawing Algorithm-

Given the starting and ending coordinates of a line, Bresenham Line Drawing Algorithm
attempts to generate the points between the starting and ending coordinates.
Bresenham’s Line Drawing Algo
Bresenham’s Line Drawing Algorithm

You might also like