Graphics

History of Computer Graphics – 1950s to 2010s

In this article, we will study how the present graphics have evolved over time, thus helping us interact with such great interfaces and enriching our user experience. 1950s So, the development of computer graphics started in the early 1950s, when projects like Whirlwind and Sage developed the Cathode Ray Tube which was used to display …

Cohen Sutherland Line Clipping Algorithm in C and C++

Here you will learn about cohen sutherland line clipping algorithm in C and C++. This is one of the oldest and most popular line clipping algorithm. To speed up the process this algorithm performs initial tests that reduce number of intersections that must be calculated. It does so by using a 4 bit code called as …

Liang Barsky Line Clipping Algorithm in C and C++

Here you will learn about liang barsky line clipping algorithm in C and C++. This Algorithm was developed by Liang and Barsky. It is used for line clipping as it is more efficient than Cyrus Beck algorithm and Cohen Sutherland algorithm because it uses more efficient parametric equations to clip the given line. These parametric equations …

Boundary Fill Algorithm in C and C++

Here you will learn about boundary fill algorithm in C and C++. Boundary Fill is another seed fill algorithm in which edges of the polygon are drawn. Then starting with some seed any point inside the polygon we examine the neighboring pixels to check whether the boundary pixel is reached. If boundary pixels are not …

Flood Fill Algorithm in C and C++

Here you will learn about flood fill algorithm in C and C++. Flood Fill is a seed fill algorithm similar to Boundary Fill algorithm but sometimes when it is required to fill in an area that is not defined within a single color boundary we use flood fill instead of boundary fill. For this purpose …

DDA Line Drawing Algorithm in C and C++

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) Algorithm. A line connects two points. It is a basic element in graphics. To draw a line, you need two points between which you can draw a line. Also …

Bresenham’s Line Drawing Algorithm in C and C++

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. The program will work in Turbo C or Turbo C++ compiler as it uses graphics.h header file. Make sure to change the path of BGI folder inside initgraph() function according to your …

Midpoint Circle Algorithm in C and C++

Here you will get program for midpoint circle algorithm in C and C++. It is an algorithm used in computer graphics for drawing circle. This program will work in Turbo C or Turbo C++ compiler as it uses graphics.h header file. Change the path of BGI file inside initgraph() function according to your system to …