Bresenham’s circle algorithm is an efficient way to draw a circle using only integer calculations. It eliminates the need for floating-point arithmetic and is widely used in computer graphics.

Below is the implementation of Bresenham’s circle drawing algorithm using C++ and the graphics.h library. This program takes user input for the circle’s center and radius, then uses the algorithm to plot the circle.

Here is implementation of Boundary Fill Algorithm in C++.

Continue reading Implementing Boundary Fill Algorithm in C++ →

Bresenham’s line algorithm is an 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 lines on a computer screen, as it uses only integer addition, subtraction and bit shifting.

Continue reading Implementing Bresenham’s Line Algorithm in C++ →

Here is C++ code to perform 2-D transformation.