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 Boundary_fill(const int,const int,const int,const int);

 void Circle(const int,const int,const int);
 void Triangle(const int,const int,const int,const int,const int,const int);
 void Rectangle(const int,const int,const int,const int);
 void Polygon(const int,const int []);
 void Line(const int,const int,const int,const int);


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

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

       show_screen( );

       setcolor(15);
     Circle(175,175,40);

     Boundary_fill(175,175,10,15);

       setcolor(15);
       settextstyle(0,0,1);
     outtextxy(150,225,\"Circle\");

       setcolor(15);
     Rectangle(375,145,475,205);

     Boundary_fill(400,175,9,15);

       setcolor(15);
       settextstyle(0,0,1);
     outtextxy(390,215,\"Rectangle\");

       setcolor(15);
     Triangle(135,360,215,360,175,290);

     Boundary_fill(175,325,8,15);

       setcolor(15);
       settextstyle(0,0,1);
     outtextxy(145,370,\"Triangle\");

       int polygon_points[14]={ 365,325, 400,290, 450,290, 485,325,
                        450,360, 400,360, 365,325 };

       setcolor(15);
     Polygon(7,polygon_points);

     Boundary_fill(425,325,12,15);

       setcolor(15);
       settextstyle(0,0,1);
     outtextxy(395,370,\"Polygon\");

       getch( );
       return 0;
    }


 //--------------------------  Boundary_fill( )  -------------------------//


 void Boundary_fill(const int x,const int y,
                 const int fill_color,const int boundary_color)
    {
       if(getpixel(x,y)!=boundary_color && getpixel(x,y)!=fill_color)
      {
         putpixel(x,y,fill_color);

         Boundary_fill((x+1),y,fill_color,boundary_color);
         Boundary_fill((x-1),y,fill_color,boundary_color);
         Boundary_fill(x,(y+1),fill_color,boundary_color);
         Boundary_fill(x,(y-1),fill_color,boundary_color);
      }
    }


 //------------------------------  Circle( )  ----------------------------//


 void Circle(const int h,const int k,const int r)
    {
       int color=getcolor( );

       int x=0;
       int y=r;
       int p=(1-r);

       do
      {
         putpixel((h+x),(k+y),color);
         putpixel((h+y),(k+x),color);
         putpixel((h+y),(k-x),color);
         putpixel((h+x),(k-y),color);
         putpixel((h-x),(k-y),color);
         putpixel((h-y),(k-x),color);
         putpixel((h-y),(k+x),color);
         putpixel((h-x),(k+y),color);

         x++;

         if(p<0)
        p+=((2*x)+1);

         else
        {
           y--;
           p+=((2*(x-y))+1);
        }
      }
       while(x<=y);
    }


 //----------------------------  Triangle( )  ----------------------------//


 void Triangle(const int x_1,const int y_1,const int x_2,const int y_2,
                        const int x_3,const int y_3)
    {
       Line(x_1,y_1,x_2,y_2);
       Line(x_2,y_2,x_3,y_3);
       Line(x_3,y_3,x_1,y_1);
    }


 //---------------------------  Rectangle( )  ----------------------------//


 void Rectangle(const int x_1,const int y_1,const int x_2,const int y_2)
    {
       Line(x_1,y_1,x_2,y_1);
       Line(x_2,y_1,x_2,y_2);
       Line(x_2,y_2,x_1,y_2);
       Line(x_1,y_2,x_1,y_1);
    }


 //-----------------------------  Polygon( )  ----------------------------//


 void Polygon(const int n,const int coordinates[])
    {
       if(n>=2)
      {
         Line(coordinates[0],coordinates[1],
                         coordinates[2],coordinates[3]);

         for(int count=1;count<(n-1);count++)
        Line(coordinates[(count*2)],coordinates[((count*2)+1)],
                        coordinates[((count+1)*2)],
                        coordinates[(((count+1)*2)+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(220,26,420,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(228,29,\"Boundary Fill Algorithm\");

     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(229,450,\"Press any Key to exit.\");
    }

    Related Post:
  1. Program to construct Newtons Divided Difference Interpolation Formula from the given distinct data points and estimate the value of the function

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

  3. Program of stack to traverse in inorder, postorder and preorder

  4. Program that takes input of students and result obtained, based on that provides rank

  5. Program to draw a line using Cartesian Slope-Intercept Equation

  6. Program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expres......

  7. Program to illusrate data conversion b/w built-in data types and user defined data types(in char)

  8. Program that performs SCANNING of the following program and finds the entire float,integer variables and keywords present in the program

  9. Program to implement the Kurskals Algorithm to solve Minimum Cost Spanning Tree Problem (MST) using Graphics with Mouse Support

  10. Program to illusrate data conversion b/w built-in data types and user defined data types (int & float)

  11. Program to show the implementation of Binary Search Tree as Sets

  12. Program that provides an example of binary files

  13. Program of doubly link list

  14. Program to illusrate data conversion user defined data types using functions

  15. Program of tower of hanoi

  16. Program to illustrate supplying of values to pointer variables

  17. Program to covert a given decimal number into Roman Code

  18. Program to illustrate the declaration , initialization and printing a constant variable

  19. Program to read 2D array and display it row by row and its sum

  20. Program to illustrate the implementation of Reflection Transformation about the line y=x and y=-x

 
 
Didn't find what you were looking for? Find more on Program to fill different types of geometric shapes using Boundary Fill Algorithm