Algorithms in Computer Graphics

Though there are a lot of the algorithms used for various purposes in graphics, here we’ll be dealing with very few of them that are easy to understand, as a beginer.

These algorithms are are related to the folowing concepts:

• Line Drawing
• Line Clipping
• Circle Drawing
• Curve Tracing
• 2D & 3D Transformation
  • Scaling
  • Translating
  • Shearing
  • Reflecting
  • Rotating
  • Projection etc..

Most of these algorithms are from the prescribed practical list of syllabus of B.Sc. (H) Computer Science. Hence, those are placed separatly into practicals directory.

Impleted Algorithms:

Following are some C++ programs where the above listed programs are implemented:

1. Bresenham’s Line Lrawing Algorithm:
   

2. Mid-Point Circle Drawing Algorithm:
   

3. Cohen and Sutherland Line Clipping Algorithm:
   

4. Sutherland Hodgeman Polygon Clipping Algorithm:
   

5. Scan Line Fill Algorithm for Polygon:
   Diring the execution of algo.
   After complete fill
   

6. 2-D Transformations:
   Input co-ordinates
   Reflection
   
   Rotation
   
   

7. 3-D Transformations:
   3-D Figure
   Scaling
   
   Perspective Projection
   
   

8. Hermite / Bezier Curve:
   

Apart from these, Digital Differential Analyzer(DDA) is also implemented that is one of the earlier algorithms, used for line drawing.

The output of DDA is: