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 <dos.h>
# include <stdio.h>
# include <graphics.h>
# include <iostream.h>
# include <conio.h>
# include <math.h>

struct Polygon
{
    int x;
    int y;
};

struct edRecord
{
    int YUpper;
    float XIntersect;
    float dxperscan;
    struct edRecord *Next;
};

typedef struct edRecord Edge;
typedef struct Polygon Nodes;
Edge  *Active;
Edge **Edges;
int Cntr=6;
Nodes NodesObj[6]={{100,100},{150,150},{150,200},{100,250},{50,200},{50,150}};

void Scanfill();
void InsertEdge(Edge*,Edge*);
void BuildEdgeList(int,Nodes*);
int YNext(int);
void MakeEdgeRec(Nodes,Nodes,int,Edge*);
void BulidActiveList(int);
void UpdateActiveList(int);
void DeleteAfter(Edge*);
void ResortActiveList(void);
void ResortActiveList(int);

//**************************************************************************
void main()
{
    int gDriver = DETECT, gMode;
    int n,xArray[12];
    int iCntr,jCntr;

    initgraph(&gDriver,&gMode,\"c:\\\\tc\\\\bgi\");

    for(iCntr=0,jCntr=0;iCntr<12;iCntr+=2,jCntr++)
        xArray[iCntr] = NodesObj[jCntr].x;
    for(iCntr=1,jCntr=0;iCntr<12;iCntr+=2,jCntr++)
        xArray[iCntr] = NodesObj[jCntr].y;

    drawpoly(6,xArray);

    line(NodesObj[5].x,NodesObj[5].y,NodesObj[0].x,NodesObj[0].y);   //TO CLOSE POLYGON
    getch();

    Scanfill();
    getch();
    closegraph();
    restorecrtmode();
    return;
}

//**************************************************************************

void Scanfill()
{
    int iCntr,Scan;
    //initialize edgelists with dummy nodes
    Edges=new Edge*[getmaxy()];
    for(iCntr=0;iCntr<getmaxy();iCntr++)
    {
        Edges[iCntr] = new Edge;
        Edges[iCntr]->Next = NULL;
    }
    //initialize Active edgeList with dummy nodes
    Active = new Edge;
    Active->Next = NULL;
    BuildEdgeList(Cntr,NodesObj);
    for(Scan=0;Scan<getmaxy();Scan++)
    {
        BulidActiveList(Scan);
        if (Active->Next != NULL)
        {
            ResortActiveList(Scan);
            UpdateActiveList(Scan);
            ResortActiveList();
        }
    }
}

//**************************************************************************

void InsertEdge(Edge* edgeList,Edge* InitialEdge)
{
    Edge *PEdge,*QEdges;

    QEdges=edgeList;
    PEdge=QEdges->Next;
    while(PEdge!=NULL)
    if(InitialEdge->XIntersect < PEdge->XIntersect)
    PEdge=NULL;
    else
    {
        QEdges=PEdge;
        PEdge=PEdge->Next;
    }
    InitialEdge->Next = QEdges->Next;
    QEdges->Next = InitialEdge;
}

//**************************************************************************

void BuildEdgeList(int Cntr,Nodes* Vertices)
{
    Edge* NewEdge;
    Nodes Vertex1,Vertex2;
    int YPrev,iCntr;
    Vertex1.x=Vertices[Cntr-1].x;
    Vertex1.y=Vertices[Cntr-1].y;
    YPrev = Vertices[Cntr-2].y;
    for(iCntr=0;iCntr<Cntr;iCntr++)
    {
        Vertex2.x = Vertices[iCntr].x;
        Vertex2.y = Vertices[iCntr].y;
        if(Vertex1.y != Vertex2.y)
        {
            NewEdge = new Edge;
            if(Vertex1.y < Vertex2.y)
                MakeEdgeRec(Vertex1,Vertex2,YNext(iCntr),NewEdge);
            else
                MakeEdgeRec(Vertex2,Vertex1,YPrev,NewEdge);
        }
        YPrev = Vertex1.y;
        Vertex1.x = Vertex2.x;
        Vertex1.y = Vertex2.y;
    }
}

//**************************************************************************

void BulidActiveList(int Scan)
{
    Edge *PEdge,*QEdges;
    PEdge=Edges[Scan]->Next;
    while(PEdge!=NULL)
    {
        QEdges=PEdge->Next;
        InsertEdge(Active,PEdge);
        PEdge=QEdges;
    }
}

//***************************************************************************

void ResortActiveList(int Scan)
{
    Edge *iEdge,*jEdge;
    int iCntr;
    iEdge = Active->Next;
    while(iEdge!=NULL)
    {
        jEdge = iEdge->Next;
        for(iCntr=iEdge->XIntersect;iCntr<=jEdge->XIntersect-1;iCntr++)
            putpixel(iCntr,Scan,RED);
        iEdge=jEdge->Next;
    }
}
//***************************************************************************

void UpdateActiveList(int Scan)
{
    Edge *PEdge,*QEdges;
    QEdges=Active;
    PEdge=Active->Next;
    while(PEdge!=NULL)
    {
        if(Scan>=PEdge->YUpper)
        {
            PEdge=PEdge->Next;
            DeleteAfter(QEdges);
        }
        else
        {
            PEdge->XIntersect+=PEdge->dxperscan;
            QEdges=PEdge;
            PEdge=PEdge->Next;
        }
    }
}
//***************************************************************************
void ResortActiveList()
{
    Edge *PEdge,*QEdges;
    PEdge=Active->Next;
    Active->Next=NULL;
    while(PEdge!=NULL)
    {
        QEdges=PEdge->Next;
        InsertEdge(Active,PEdge);
        PEdge=QEdges;
    }
}

//***************************************************************************

int YNext(int YCurr)
{
    int jCntr;
    if(YCurr+1>Cntr)
        jCntr=1;
    else
        jCntr=YCurr+1;
    while(NodesObj[YCurr].y == NodesObj[jCntr].y)
    {
        if(jCntr+1>Cntr)
            jCntr=1;
        else
            jCntr++;
    }
    return(NodesObj[jCntr].y);
}

//***************************************************************************

void DeleteAfter(Edge* QEdges)
{
    Edge* PEdge;

    PEdge = QEdges->Next;
    QEdges->Next = PEdge->Next;
    delete PEdge;
}

//***************************************************************************

void MakeEdgeRec(Nodes Lower,Nodes Upper,int YComp,Edge* CurrEdge)
{
    CurrEdge->dxperscan = (Upper.x - Lower.x) / (Upper.y - Lower.y);
    CurrEdge->XIntersect = Lower.x;
    if(Upper.y < YComp)
        CurrEdge->YUpper = Upper.y - 1;
    else
        CurrEdge->YUpper = Upper.y;
    InsertEdge(Edges[Lower.y],CurrEdge);
}

 
 
Didn't find what you were looking for? Find more on Program of scanfill algorithm