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>


 //---------------------------  LineCoordinates  -------------------------//


 class LineCoordinates
    {
       public:
      float x_1;
      float y_1;
      float x_2;
      float y_2;

      LineCoordinates(const float x1,const float y1,
                          const float x2,const float y2)
         {
        x_1=x1;
        y_1=y1;
        x_2=x2;
        y_2=y2;
         }
    };


 //-------------------------  WindowCoordinates  -------------------------//


 class WindowCoordinates
    {
       public:
      float x_min;
      float y_min;
      float x_max;
      float y_max;

      WindowCoordinates(const float x1,const float y1,
                          const float x2,const float y2)
         {
        x_min=x1;
        y_min=y1;
        x_max=x2;
        y_max=y2;
         }
    };


 //-----------------------------  RegionCode  ----------------------------//


 class RegionCode
    {
       public:
      int bit_1;
      int bit_2;
      int bit_3;
      int bit_4;

      RegionCode( )
         {
        bit_1=0;
        bit_2=0;
        bit_3=0;
        bit_4=0;
         }

      const int equal_zero( )
         {
        if(bit_1==0 && bit_2==0 && bit_3==0 && bit_4==0)
           return 1;

        return 0;
         }

      void get_logical_AND(RegionCode rc1,RegionCode rc2)
         {
        if(rc1.bit_1==1 && rc2.bit_1==1)
           bit_1=1;

        if(rc1.bit_2==1 && rc2.bit_2==1)
           bit_2=1;

        if(rc1.bit_3==1 && rc2.bit_3==1)
           bit_3=1;

        if(rc1.bit_4==1 && rc2.bit_4==1)
           bit_4=1;
         }

      void get_region_code(const WindowCoordinates wc,
                           const int x,const int y)
         {
        if((wc.x_min-x)>0)
           bit_1=1;

        if((x-wc.x_max)>0)
           bit_2=1;

        if((wc.y_min-y)>0)
           bit_3=1;

        if((y-wc.y_max)>0)
           bit_4=1;
         }
    };


 void show_screen( );

 const int clip_line(const WindowCoordinates,LineCoordinates&);

 void calculate_intersecting_points(const WindowCoordinates,LineCoordinates&);

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

       WindowCoordinates WC(180,140,470,340);

       setcolor(15);
     Rectangle(WC.x_min,WC.y_min,WC.x_max,WC.y_max);

       LineCoordinates LC_1(150,160,120,320);
       LineCoordinates LC_2(250,150,200,200);
       LineCoordinates LC_3(160,200,490,260);
       LineCoordinates LC_4(300,300,400,380);
       LineCoordinates LC_5(550,300,450,400);
       LineCoordinates LC_6(440,110,400,370);

       setcolor(7);
     Line(LC_1.x_1,LC_1.y_1,LC_1.x_2,LC_1.y_2);
     Line(LC_2.x_1,LC_2.y_1,LC_2.x_2,LC_2.y_2);
     Line(LC_3.x_1,LC_3.y_1,LC_3.x_2,LC_3.y_2);
     Line(LC_4.x_1,LC_4.y_1,LC_4.x_2,LC_4.y_2);
     Line(LC_5.x_1,LC_5.y_1,LC_5.x_2,LC_5.y_2);
     Line(LC_6.x_1,LC_6.y_1,LC_6.x_2,LC_6.y_2);

       char Key=NULL;

       do
      {
         Key=getch( );
      }
       while(Key!=\'C\' && Key!=\'c\');

       settextstyle(0,0,1);
     setcolor(0);
       outtextxy(163,450,\"  Press \'C\' to see the Clipped Lines.  \");

    setcolor(15);
       outtextxy(165,450,\"------                          -------\");

     setcolor(12);
       outtextxy(213,450,\"  Press any Key to exit.  \");

       setcolor(10);

       if(clip_line(WC,LC_1))
      Line(LC_1.x_1,LC_1.y_1,LC_1.x_2,LC_1.y_2);

       if(clip_line(WC,LC_2))
      Line(LC_2.x_1,LC_2.y_1,LC_2.x_2,LC_2.y_2);

       if(clip_line(WC,LC_3))
      Line(LC_3.x_1,LC_3.y_1,LC_3.x_2,LC_3.y_2);

       if(clip_line(WC,LC_4))
      Line(LC_4.x_1,LC_4.y_1,LC_4.x_2,LC_4.y_2);

       if(clip_line(WC,LC_5))
      Line(LC_5.x_1,LC_5.y_1,LC_5.x_2,LC_5.y_2);

       if(clip_line(WC,LC_6))
      Line(LC_6.x_1,LC_6.y_1,LC_6.x_2,LC_6.y_2);

       getch( );
       return 0;
    }


 //---------------------------  clip_line( )  ----------------------------//


 const int clip_line(const WindowCoordinates wc,LineCoordinates &lc)
    {
       RegionCode rc1,rc2,rc;

       rc1.get_region_code(wc,lc.x_1,lc.y_1);
       rc2.get_region_code(wc,lc.x_2,lc.y_2);
       rc.get_logical_AND(rc1,rc2);

       if(rc1.equal_zero( ) && rc2.equal_zero( ))
      {
         lc.x_1=(int)(lc.x_1+0.5);
         lc.y_1=(int)(lc.y_1+0.5);
         lc.x_2=(int)(lc.x_2+0.5);
         lc.y_2=(int)(lc.y_2+0.5);

         return 1;
      }

       else if(!rc.equal_zero( ))
      return 0;

       else
      {
         calculate_intersecting_points(wc,lc);
         clip_line(wc,lc);
      }

       return 1;
    }


 //-----------------  calculate_intersecting_points( )  ------------------//


 void calculate_intersecting_points(const WindowCoordinates wc,
                            LineCoordinates &lc)
    {
       RegionCode rc1,rc2,rc;

       rc1.get_region_code(wc,lc.x_1,lc.y_1);
       rc2.get_region_code(wc,lc.x_2,lc.y_2);

       if(!rc1.equal_zero( ))
      {
         float m;
         float x=lc.x_1;
         float y=lc.y_1;

         int dx=(lc.x_2-lc.x_1);

         if(dx!=0)
        m=((lc.y_2-lc.y_1)/(lc.x_2-lc.x_1));

         if(rc1.bit_1==1)
        {
           x=wc.x_min;
           y=(lc.y_1+(m*(x-lc.x_1)));
        }

         else if(rc1.bit_2==1)
        {
           x=wc.x_max;
           y=(lc.y_1+(m*(x-lc.x_1)));
        }

         else if(rc1.bit_3==1)
        {
           y=wc.y_min;

           if(dx!=0)
              x=(lc.x_1+((y-lc.y_1)/m));
        }

         else if(rc1.bit_4==1)
        {
           y=wc.y_max;

           if(dx!=0)
              x=(lc.x_1+((y-lc.y_1)/m));
        }

         lc.x_1=x;
         lc.y_1=y;
      }

       if(!rc2.equal_zero( ))
      {
         float m;
         float x=lc.x_2;
         float y=lc.y_2;

         int dx=(lc.x_2-lc.x_1);

         if(dx!=0)
        m=((lc.y_2-lc.y_1)/(lc.x_2-lc.x_1));

         if(rc2.bit_1==1)
        {
           x=wc.x_min;
           y=(lc.y_2+(m*(x-lc.x_2)));
        }

         else if(rc2.bit_2==1)
        {
           x=wc.x_max;
           y=(lc.y_2+(m*(x-lc.x_2)));
        }

         else if(rc2.bit_3==1)
        {
           y=wc.y_min;

           if(dx!=0)
              x=(lc.x_2+((y-lc.y_2)/m));
        }

         else if(rc2.bit_4==1)
        {
           y=wc.y_max;

           if(dx!=0)
              x=(lc.x_2+((wc.y_max-lc.y_2)/m));
        }

         lc.x_2=x;
         lc.y_2=y;
      }
    }


 //---------------------------  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);
    }


 //-------------------------------  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(145,26,480,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(152,29,\"Cohen-Sutherland Line Clipping 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(163,450,\"  Press \'C\' to see the Clipped Lines.  \");
    }

    Related Post:
  1. Library Management System

  2. Program of nesting member functions, private member functions and array of objects

  3. Program that reads a numbers , computes and displays the factorial of the given number using recursion

  4. Program that take font and background color and text input from a user and display it in center aligned

  5. Program that displays the size, address of the variables of type int , float and char.

  6. File Operation Program

  7. Program that will read a token from a user and find its type

  8. Program to sort numbers using quick sort and bubble sort

  9. Program to read all words from a file and remove all words which are palindromes

  10. Program to add two polynomial functions

  11. Program to estimate the Integral value of a given function using Gussian Quadrature Rule

  12. Program of Shortest Path for Given Source and Destination (using Dijkstras Algo.)

  13. Program to illustrate over-riding of base class member function in a derived class

  14. Program to rotate the word Computer by 1 results in rCompute

  15. Program to estimate the value of Third Derivative of the function at the given points from the given data using Central Difference Formula of order 2

  16. PROGRAM OF OVERLOADING ARITHMETIC OPERATORS ON OBJECTS OF CLASS FLOAT HAVING AN DATA MEMBERS OF TYPE FLOAT

  17. Program to illustrate the use of pointer this using header file this.h

  18. Program to fill a Circle using Scan-Line Circle Fill Algorithm using Polar Coordinates

  19. Program to show the implementation of Linked List as a Binary Search Tree

  20. Text Animation in Graphics Screen

 
 
Didn't find what you were looking for? Find more on Program to show the implementation of Cohen-Sutherland Line Clipping Algorithm