↓ • Mark V A simple way to explain this might be that you’re simply counting the number of ‘steps’ to take between Point 1 and Point 2, calculating the x-axis length and y-axis of each ‘step’, and then looping to add that step length to X and Y respectively for each step between point 1 to point 2. Unless I’m mistaken, your algorithm here (and your Bresenham algorithm too) only works when X2 >X1 and Y2 >Y1. It’s easy to fix for any two arbitrary points: simply subtract the axis length instead of adding it (dx or dy), in the case that X1 >X2 or Y1 >Y2 respectively. Free Cccam C Line.

Here you will learn about dda line drawing algorithm in C and C++. In Computer Graphics the first basic line drawing algorithm is Digital Differential Analyzer (DDA. The c program for DDA line drawing algorithm rounds off the line coordinates to an integer which is an approximation to the expected line. However, the round operations in the algorithm are too inefficient. Here you will get program for bresenham’s line drawing algorithm in C and C++. This algorithm is used in computer graphics for drawing line.