Bresenham line drawing algorithm solved example - computer graphics

Today's topic is from Computer Graphics that how we draw lines in computer graphic devices.

As we know the line consists of two endpoints. Whenever we are drawing a line, we basically connecting two endpoints. When we are plotting these lines in computer graphics devices, we are not directly connecting them but we have to select near by pixel than this near by pixel will select another adjacent pixel and by joining those pixels we get the line.

There are various line drawing algorithms;

Two main algorithms are :

1- DDA algorithm
2- Bresenham's algorithm

So, in this video i will explain Bresenham's algorithm with example.
-------------
For any Query & Feedback, please write at: [email protected]
-------------
For latest Updates Subscribe:    / @ambreenkayani  
-------------
Join Us on Facebook : https://www.facebook.com/LearnExcelGr...