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

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

       int h=0;
       int k=0;
       int r=0;

       do
      {
         show_screen( );

         gotoxy(8,10);
         cout<<\"Central Point of the Circle : (h,k) :\";

         gotoxy(8,11);
         cout<<\"ÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍ\";

         gotoxy(12,13);
         cout<<\"Enter the value of h = \";
         cin>>h;

         gotoxy(12,14);
         cout<<\"Enter the value of k = \";
         cin>>k;

         gotoxy(8,18);
         cout<<\"Radius of the Circle : r :\";

         gotoxy(8,19);
         cout<<\"ÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍÍ\";

         gotoxy(12,21);
         cout<<\"Enter the value of r = \";
         cin>>r;

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

         setcolor(15);
           polynomial_circle(h,k,r);

         setcolor(15);
           outtextxy(110,460,\"Press <Enter> to continue or any other key to exit.\");

         int key=int(getch( ));

         if(key!=13)
        break;
      }
       while(1);

       return 0;
    }


 //------------------------  polynomial_circle( )  -----------------------//


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

       float x=0;
       float y=0;
       float range=(r/M_SQRT2);

       do
      {
         y=sqrt(pow(r,2)-pow(x,2));

         putpixel((int)(h+x+0.5),(int)(k+y+0.5),color);
         putpixel((int)(h+y+0.5),(int)(k+x+0.5),color);
         putpixel((int)(h+y+0.5),(int)(k-x+0.5),color);
         putpixel((int)(h+x+0.5),(int)(k-y+0.5),color);
         putpixel((int)(h-x+0.5),(int)(k-y+0.5),color);
         putpixel((int)(h-y+0.5),(int)(k-x+0.5),color);
         putpixel((int)(h-y+0.5),(int)(k+x+0.5),color);
         putpixel((int)(h-x+0.5),(int)(k+y+0.5),color);

         x+=0.05;
      }
       while(x<=range);
    }


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


 void show_screen( )
    {
       restorecrtmode( );
       textmode(C4350);

       cprintf(\"\\n********************************************************************************\");
       cprintf(\"*****************************-                     -****************************\");
       cprintf(\"*----------------------------- \");

       textbackground(1);
       cprintf(\" Polynomial Method \");
       textbackground(8);

       cprintf(\" ----------------------------*\");
       cprintf(\"*-***************************-                     -**************************-*\");
       cprintf(\"*-****************************************************************************-*\");

       for(int count=0;count<42;count++)
      cprintf(\"*-*                                                                          *-*\");

       gotoxy(1,46);
       cprintf(\"*-****************************************************************************-*\");
       cprintf(\"*------------------------------------------------------------------------------*\");
       cprintf(\"********************************************************************************\");

       gotoxy(1,2);
    }

    Related Post:
  1. Program to illustrate operator overloading from class to basic type

  2. Program to show the Simple implementation of Hashing

  3. Program to illustrate the use of operator * and &

  4. Program to illustrate the multi-level inheritance

  5. Program to illustrate the use of the break statement

  6. Program to illustrate the use of function overloading

  7. Program to illustrate the implementation of Scaling Transformation

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

  9. Program to add, subtract, multiply, sort, search, transpose and merge matrices

  10. Program to draw a Chess Board

  11. Program of traversing a binary tree in inorder, preorder and postorder fashion

  12. Program to show the implementation of None-or-All Character Clipping Strategy (Text Clipping Example)

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

  14. Program to illustrate the implementation of Scaling Transformation

  15. Develop a Toy Compiler, which takes a series of statements as input, and creates a symbol table from it

  16. Program to illustrate the different features of an array of char known as string

  17. Program to find largest element of an array

  18. Program that uses this DFA and validates whether an entered string is valid integer or not.

  19. Program to illustrate the implementation of arrays as a Stack

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

 
 
Didn't find what you were looking for? Find more on Program to draw a circle using Polynomial Method