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>

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

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


 void show_screen( );

 const int clip_point(const WindowCoordinates,const int,const int);

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

       int points[12][2]={ {160,160} , {155,300} , {200,200} , {320,240} ,
               {225,175} , {400,150} , {275,325} , {450,320} ,
               {300,120} , {500,225} , {350,350} , {500,360} };

       for(int count_1=0;count_1<12;count_1++)
      putpixel(points[count_1][0],points[count_1][1],7);

       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 Points. \");

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

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

       for(int count_2=0;count_2<12;count_2++)
      {
         if(clip_point(WC,points[count_2][0],points[count_2][1]))
         putpixel(points[count_2][0],points[count_2][1],10);
      }

       getch( );
       return 0;
    }



 //---------------------------  clip_point( )  ---------------------------//


 const int clip_point(const WindowCoordinates wc,const int x,const int y)
    {
       if((x>=wc.x_min && x<=wc.x_max) && (y>=wc.y_min && y<=wc.y_max))
      return 1;

       return 0;
    }


 //---------------------------  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(247,26,380,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(256,29,\"Point Clipping\");

     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 Points. \");
    }

    Related Post:
  1. Program to illustrate classes with inline functions

  2. CREATING A CLASS ACCOUNTS FROM WHICH ARE DERIVED TWO CLASSES CURRENT AND SAVINGS AND THEN ASK THE USER FOR THE TYPE OF ACCOUNT HE WANTS TO CREATE

  3. Program to perform merge sort

  4. Program to illustrate classes without using inline functions

  5. Program to estimate the Integral value of the function at the given points from the given data using Simpsons 1/3 Rule

  6. Program to implement the Kurskals Algorithm to solve Minimum Cost Spanning Tree Problem (MST)

  7. Problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs

  8. Program that prints first 20 integers (using while loop)

  9. PROGRAM TO DISPLAY MESSAGE USING COUT

  10. Program of disk editor

  11. Program that sorts numbers using topological sort method

  12. Program of Liang Barsky Algorithm for Line Clipping

  13. Program to show the 3D Shearing Transformation along y-axis

  14. Program to check whether a word is palindrome or not (using classes & pointers )

  15. Nested Structure Database Program

  16. Program of maintaining banking account information system using inheritance

  17. Program to illustrate the role of constructor in classes

  18. Program to draw a line using Bresenhams Line Algorithm (BLA) for lines with slopes negative and greater than 1

  19. Program to illustrate the implementation of Scaling Transformation along Arbitrary Direction

  20. Program to estimate the value of First Derivative of the function at the given points from the given data using Central Difference Formula of order 4

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