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<stdlib.h>
#include<conio.h>
#include<graphics.h>
#include<dos.h>

class Circle
{
    int XCoord;
    int YCoord;
    int Radius;
    void PlotPoint(int,int,int);
    public:
    Circle()
    {
        XCoord=0;
        YCoord=0;
        Radius=0;
    }

    Circle(int x, int y, int z)
    {
        XCoord=x;
        YCoord=y;
        Radius=z;
    }

    void CircleMidpoint();
    void InitGraphs();
    void BoundryFill(int,int,int,int);
    void BoundryFillRound();
};

void Circle :: InitGraphs()
{
    int gMode, gDriver=DETECT;
    int errorcode;
    initgraph(&gDriver,&gMode,\"c:\\\\tc\\\\bgi\");
    errorcode = graphresult();

    if (errorcode != grOk)  /* an error occurred */
    {
       cout<<\"Graphics error: \"<< grapherrormsg(errorcode);
       cout<<\"Press any key to halt:\";
       getch();
       exit(1);             /* return with error code */
    }
    setbkcolor(3);
}

void Circle :: PlotPoint(int x,int y,int z)
{
    putpixel(XCoord+x,YCoord+y,z);
    putpixel(XCoord-x,YCoord+y,z);
    putpixel(XCoord+x,YCoord-y,z);
    putpixel(XCoord-x,YCoord-y,z);
    putpixel(XCoord+y,YCoord+x,z);
    putpixel(XCoord-y,YCoord+x,z);
    putpixel(XCoord+y,YCoord-x,z);
    putpixel(XCoord-y,YCoord-x,z);
}

void Circle :: CircleMidpoint()
{
    int x,y;
    int p;
    x=0;
    y=Radius;
    PlotPoint(x,y,15);

    p=1-Radius;
    while(x<y)
    {
        if(p<0)
            x+=1;
        else
        {
            x+=1;
            y-=1;
        }

        if(p<0)
            p=p+2*x+1;
        else
        {
            p=p + 2 *(x-y) + 1;
        }
        PlotPoint(x,y,15);
    }
}

void Circle :: BoundryFillRound()
{
    int x,y;
    int p;
    for(int iCntr=1;iCntr<Radius;iCntr++)
    {
    x=0;
    y=iCntr;
    PlotPoint(x,y,5);

    p=1-iCntr;
    while(x<y)
    {
        if(p<0)
            x+=1;
        else
        {
            x+=1;
            y-=1;
        }

        if(p<0)
            p=p+2*x+1;
        else
        {
            p=p + 2 *(x-y) + 1;
        }
        PlotPoint(x,y,5);
    }
//    sleep(1);
    }
}

void Circle :: BoundryFill(int x, int y,int fill,int bound)
{
    int cur;
    cur=getpixel(x,y);
    if(cur!=bound && cur!= fill)
    {
        putpixel(x,y,fill);
        Circle :: BoundryFill(x+1, y,fill,bound);
        Circle :: BoundryFill(x-1, y,fill,bound);
        Circle :: BoundryFill(x, y-1,fill,bound);
        Circle :: BoundryFill(x, y+1,fill,bound);
        Circle :: BoundryFill(x+1, y+1,fill,bound);
        Circle :: BoundryFill(x+1, y+1,fill,bound);
        Circle :: BoundryFill(x-1, y-1,fill,bound);
        Circle :: BoundryFill(x-1, y+1,fill,bound);
    }
}

void main()
{
    Circle cObj(250,250,42);
    cObj.InitGraphs();
    cObj.CircleMidpoint();
    cObj.BoundryFillRound();
    //cObj.BoundryFill(250,250,11,15);
    getch();
    closegraph();
}

    Related Post:
  1. Program of circular doubly link list with insert, append, delete, copy, reverse and display operations

  2. Program to perform shell sort

  3. Program that reads a number and displays it with its digits in reverse order (using while loop)

  4. Program to draw a circle using Trigonometric Method

  5. Program that creats a 3D solid object using Translational Sweep Representatiom Method

  6. Program that takes input of vector elements and performs multiplication operation, and input/output (&gt;&gt;, &lt;&lt;) using operator overloading

  7. Program that reads in a matrix and checks if it has the parity property

  8. Program to draw a line using Cartesian Slope-Intercept Equation [ Simple Implementation ]

  9. Program to print, read and calculate sum, smallest, largest element an array using pointers

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

  11. Program of Breadth First Search Traversal ( BFS )

  12. Program to print an array before and after adding 5 to its contents using pointers

  13. Program of heap sort

  14. Program that reads a number and displays it with its digits in reverse order using do-while loop

  15. Program to show the 3D Shearing Transformation along z-axis

  16. Program to show the implementation of Cohen-Sutherland Line Clipping Algorithm

  17. Program that will allow a spy to encode and decode messages

  18. Program of class and objects using private and public data members

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

  20. Program that computes and displays the factorial of the given number using recursion

 
 
Didn't find what you were looking for? Find more on Program of Boundary Fill (8 Connected Point).