To accomplish this, the algorithm always increments either x or y by one unit depending on the slope of line. Bresenham Line Drawing Algorithm determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight. It is an efficient method because it involves only integer addition.

This portion of the above routine works the same but the values are stored in a single variable (screen) which holds the memory address of the current pixel, screeninc1 and screeninc2 are the update values for screen. The basic principle of Bresenhams line algorithm is to select the optimum raster locations to represent a straight line. Title: Bresenhams Line Algorithm (THICK LINE) Description: An algorithm to draw a Thick Line using Bresenhams Line Drawing Algorithm Author: Saideep Dicholkar / include < stdio.h > include < graphics.h > include < math. This algorithm is used for scan converting a line. bresenham's line drawing algorithm

Note that if you are writing a line routine for mode 13h (for example) you can speed it up by converting the inner loop to assembly and including mode 13h specific code.

Bresenham&#39;s line drawing algorithm

Bresenham's line drawing algorithm