C++ Programming Tutorial

 
 
 

Graphics Programming

Quadratic Surfaces

Draw a Sphere using Ellipses Draw a Sphere using Parametric Equations Draw an Ellipsoid using Parametric Equations

Character Generation

Urdu Alphabets using Stroke Method Urdu Alphabets using Matrix Method

Arc

Circular Arc using Trigo. Method Elliptical Arc using Trigo. Method

General Programs

C-Curve of nth order K-Curve of nth order Cubic Bezier Curve Bezier Curve of nth degree Scanfill algorithm Boundary Fill - 8 Connected Point Flood fill algorithm Rotate About Origin Rotate about reference point Scaling about origin Scaling about reference point Polyline translation Reflection in x axis Reflection in y Axis Reflection on any line Midpoint Circle Drawing Bresenhams Line Algorithm (BLA) Generate a pattern Draw a Chess Board Draw a Luddo Board Deterministic Finite Automation for identifier Kurskals algo - Minimum Cost Spanning Tree

Windows Programs

Checkbox like windows Simple windows & buttons Moving message box like windows Text box Graphical Rep. of tower of hanoi Graphical menu - operate it using arrow keys Text animation

Line

Line using Parametric equations Line-Cartesian Slope-Intercept Equation simple imp Line using Cartesian Slope-Intercept Equation Line - BLA - slopes negative and greater than 1 Line - BLA - slopes negative and less than 1 Line - BLA - slopes positive and greater than 1 Line - BLA - slopes positive and less than 1 DDA line drawing algorithm Bresenham line drawing algorithm Cohen sutherland Line clipping algo.

Line Styles

Different kinds of Dashed Lines Different kinds of Thick Lines

Polygons

Draw a Polygon Draw a Triangle Draw a Rectangle Sutherland-Hodgeman Polygon Clipping Algo

Circle

Circle using Trigo. Method Circle using Polynomial Method Circle using Bresenhams Circle algo. Circle using MidPoint Circle algo.

Ellipse

Ellipse using Polynomial Method Ellipse using Trigo. Method Ellipse using MidPoint Ellipse algo.

2D Transformations

Translation Transformation Scaling Transformation Scaling Trans along a Fixed Point Scaling Trans along Arbitrary Direction Rotation Transformation Rotation Trans along a Pivot Point Reflection tran of x-axix, y-axis and w.r.t origin Reflection tran of line y=x and y=-x X-Direction Shear Transformation Y-Direction Shear Transformation

2D Viewing - Clipping

Window-to-Viewport Coordinate Tran Point Clipping Algorithm Cohen-Sutherland Line Clipping Algo Cohen-Sutherland MidPoint Subdivision Line Nicol Lee Nicol algo. for Line Clipping Liang-Barsky Line Clipping Algo Window-to-Viewport Transformaton None-or-All String Clipping Strategy None-or-All Character Clipping Strategy

3D Object Representations

3D object using Polygon-Mesh Rep. 3D object - Translational Sweep Representatiom 3D object - Rotational Sweep Rep.

3D Transformations

3D Rotation Trans along x-axis 3D Rotation Trans along y-axis 3D Rotation Trans along z-axis 3D Reflection Trans along xy-plane 3D Reflection Trans along yz-plane 3D Reflection Trans along zx-plane 3D Shearing Trans along x-axis 3D Shearing Trans along y-axis 3D Shearing Trans along z-axis

Bezier Curves - Surfaces

3D Cubic Bezier Curve 3D Bezier Curve of nth degree 3D Piece-Wise Bezier Curve of nth degree 3D Bezier Surface for MxN control points

Projection

3D objects - Standard Perspective Projection 3D obj - Arbitrary Plane and Center of Projection 3D objects using General Perspective Projection 3D obj-Orthographics Proje Parallel onto xy-plane 3D obj-Cavalier Oblique Parallel prj-xy-plane 3D obj-Cabinet Oblique Parallel prj - xy-plane

Fill Algorithm or Area Filling

Geometric shapes using Boundary Geometric shapes - Boundary - Linked List Geometric shapes using Flood Geometric shapes - Flood - Linked-List Polygon using Scan Line Polygon Rectangle using Scan-Line Rectangle Circle using Scan-Line Circle Circle - Scan-Line Circle - Polar Coordinates
 
 
 # include <iostream.h>
 # include <graphics.h>
 # include    <conio.h>
 # include     <math.h>

 void show_screen( );

 void draw_cube(int [8][3]);
 void draw_pyramid(int [5][3]);

 void get_projected_point(int&,int&,int&);
 void multiply_matrices(const int[4],const int[4][4],int[4]);

 void Line(const int,const int,const int,const int);


 int main( )
    {
       int driver=VGA;
       int mode=VGAHI;

       initgraph(&driver,&mode,\"..\\\\Bgi\");

       show_screen( );

       int cube[8][3]={
             {370,200,50},      //  front left top
             {470,200,50},      //  front right top
             {470,300,50},      //  front right bottom
             {370,300,50},      //  front left bottom
             {370,200,-50},     //  back left top
             {470,200,-50},     //  back right top
             {470,300,-50},     //  back right bottom
             {370,300,-50}      //  back left bottom
              };

       setcolor(15);
     draw_cube(cube);

       settextstyle(0,0,1);
     outtextxy(400,320,\"Cube\");

       int pyramid[5][3]={
                {120,300,50},      //  base front left
                {220,300,50},      //  base front right
                {220,300,-50},     //  base back right
                {120,300,-50},     //  base back left
                {170,150,0}        //  top
             };

       setcolor(15);
     draw_pyramid(pyramid);

       settextstyle(0,0,1);
     outtextxy(135,320,\"Pyramid\");

       getch( );
       closegraph( );
       return 0;
    }


 /************************************************************************/
 //----------------------------  draw_cube( )  --------------------------//
 /************************************************************************/

 void draw_cube(int edge_points[8][3])
    {
       for(int i=0;i<8;i++)
      get_projected_point(edge_points[i][0],
                     edge_points[i][1],edge_points[i][2]);

     Line(edge_points[0][0],edge_points[0][1],
                     edge_points[1][0],edge_points[1][1]);
     Line(edge_points[1][0],edge_points[1][1],
                     edge_points[2][0],edge_points[2][1]);
     Line(edge_points[2][0],edge_points[2][1],
                     edge_points[3][0],edge_points[3][1]);
     Line(edge_points[3][0],edge_points[3][1],
                     edge_points[0][0],edge_points[0][1]);

     Line(edge_points[4][0],edge_points[4][1],
                     edge_points[5][0],edge_points[5][1]);
     Line(edge_points[5][0],edge_points[5][1],
                     edge_points[6][0],edge_points[6][1]);
     Line(edge_points[6][0],edge_points[6][1],
                     edge_points[7][0],edge_points[7][1]);
     Line(edge_points[7][0],edge_points[7][1],
                     edge_points[4][0],edge_points[4][1]);


     Line(edge_points[0][0],edge_points[0][1],
                      edge_points[4][0],edge_points[4][1]);
     Line(edge_points[1][0],edge_points[1][1],
                      edge_points[5][0],edge_points[5][1]);
     Line(edge_points[2][0],edge_points[2][1],
                      edge_points[6][0],edge_points[6][1]);
     Line(edge_points[3][0],edge_points[3][1],
                      edge_points[7][0],edge_points[7][1]);
    }

 /************************************************************************/
 //--------------------------  draw_pyramid( )  -------------------------//
 /************************************************************************/

 void draw_pyramid(int edge_points[5][3])
    {
       for(int i=0;i<5;i++)
      get_projected_point(edge_points[i][0],
                    edge_points[i][1],edge_points[i][2]);

     Line(edge_points[0][0],edge_points[0][1],
                      edge_points[1][0],edge_points[1][1]);
     Line(edge_points[1][0],edge_points[1][1],
                      edge_points[2][0],edge_points[2][1]);
     Line(edge_points[2][0],edge_points[2][1],
                      edge_points[3][0],edge_points[3][1]);
     Line(edge_points[3][0],edge_points[3][1],
                      edge_points[0][0],edge_points[0][1]);

     Line(edge_points[0][0],edge_points[0][1],
                      edge_points[4][0],edge_points[4][1]);
     Line(edge_points[1][0],edge_points[1][1],
                      edge_points[4][0],edge_points[4][1]);
     Line(edge_points[2][0],edge_points[2][1],
                      edge_points[4][0],edge_points[4][1]);
     Line(edge_points[3][0],edge_points[3][1],
                      edge_points[4][0],edge_points[4][1]);
    }

 /************************************************************************/
 //---------------------  get_projected_point( )  -----------------------//
 /************************************************************************/

 void get_projected_point(int& x,int& y,int& z)
    {
       int Par_k[4][4]={
             {1,0,0,0},
             {0,1,0,0},
             {0,0,0,0},
             {0,0,0,1}
               };

       int xy[4]={x,y,z,1};
       int new_xy[4]={0};

       multiply_matrices(xy,Par_k,new_xy);

       x=new_xy[0];
       y=new_xy[1];
       z=new_xy[2];
    }

 /************************************************************************/
 //----------------------  multiply_matrices( )  ------------------------//
 /************************************************************************/

 void multiply_matrices(const int matrix_1[4],
                   const int matrix_2[4][4],int matrix_3[4])
    {
       for(int count_1=0;count_1<4;count_1++)
      {
         for(int count_2=0;count_2<4;count_2++)
        matrix_3[count_1]+=
               (matrix_1[count_2]*matrix_2[count_2][count_1]);
      }
    }


 //--------------------------  Line( )  ------------------------//


 void Line(const int x_1,const int y_1,const int x_2,const int y_2)
    {
       int color=getcolor( );

       int x1=x_1;
       int y1=y_1;

       int x2=x_2;
       int y2=y_2;

       if(x_1>x_2)
      {
         x1=x_2;
         y1=y_2;

         x2=x_1;
         y2=y_1;
      }

       int dx=abs(x2-x1);
       int dy=abs(y2-y1);
       int inc_dec=((y2>=y1)?1:-1);

       if(dx>dy)
      {
         int two_dy=(2*dy);
         int two_dy_dx=(2*(dy-dx));
         int p=((2*dy)-dx);

         int x=x1;
         int y=y1;

         putpixel(x,y,color);

         while(x<x2)
        {
           x++;

           if(p<0)
              p+=two_dy;

           else
              {
             y+=inc_dec;
             p+=two_dy_dx;
              }

           putpixel(x,y,color);
        }
      }

       else
      {
         int two_dx=(2*dx);
         int two_dx_dy=(2*(dx-dy));
         int p=((2*dx)-dy);

         int x=x1;
         int y=y1;

         putpixel(x,y,color);

         while(y!=y2)
        {
           y+=inc_dec;

           if(p<0)
              p+=two_dx;

           else
              {
             x++;
             p+=two_dx_dy;
              }

           putpixel(x,y,color);
        }
      }
    }


 //--------------------------  show_screen( )  ---------------------------//


 void show_screen( )
    {
       setfillstyle(1,1);
     bar(120,26,515,38);

       settextstyle(0,0,1);
     setcolor(15);
       outtextxy(5,5,\"******************************************************************************\");
       outtextxy(5,17,\"*-**************************************************************************-*\");
       outtextxy(5,29,\"*------------                                                    ------------*\");
       outtextxy(5,41,\"*-**************************************************************************-*\");
       outtextxy(5,53,\"*-**************************************************************************-*\");

     setcolor(11);
       outtextxy(128,29,\"Orthographics Parallel Projection onto xy-plane\");

     setcolor(15);

       for(int count=0;count<=30;count++)
          outtextxy(5,(65+(count*12)),\"*-*                                                                        *-*\");

       outtextxy(5,438,\"*-**************************************************************************-*\");
       outtextxy(5,450,\"*---------------------------                         ------------------------*\");
       outtextxy(5,462,\"******************************************************************************\");

     setcolor(12);
       outtextxy(227,450,\"  Press any key to exit \");
    }

    Related Post:
  1. Program to read a Non-Linear equation in one variable, then evaluate it using False-Position Method and display its kD accurate root

  2. Program to estimate the Integral value of the function at the given points from the given data using Romberg Method

  3. PROGRAM OF OPERATOR PRECEDENCE MATRIX

  4. Program of Deapth First Search Traversal ( DFS )

  5. Program to draw a circle using Bresenhams Circle Algorithm

  6. Program to perform quick sort

  7. Program that changes an infix expression to a postfix expression according

  8. PROGRAM TO IMPLEMENT RECURSIVE DESCENT PARSER

  9. To parse a string using First and Follow algorithm and LL-1 parser

  10. Program that reads marks obtained by a student in a test of 100 marks and print pass if marks are greater than or equal to 50

  11. Program to help Umar in this task. Represent each city by one lowercase character. Thus, you can have at most 26 different cities to visit....

  12. Program to illustrate the implementation of Rotation Transformation

  13. Write a program to Add Two Matrix

  14. Program to illustrate unary operator increment operator overloading with return type

  15. Program to convert a decimal number into binary, octal and pental code

  16. Program to illustrate the relationship b/w union and structure

  17. School management system

  18. Program to computes the product of two matrices of size 4x4 using Divide and Conquer Strategy

  19. Program to read a Non-Linear equation in one variable, then evaluate it using Secant Method and display its kD accurate root

  20. Program to illustrate the implementation of Scaling Transformation