Write C++/Java program to draw any object such as flower, waves using any curve generation techniques

Second Year Computer Engineering Computer Graphics Programs:

Computer Graphics Lab:

Practical B16:
Write C++/Java program to draw any object such as flower, waves using any curve generation techniques.

----------------------------------------------------------------------------------------------------------------------------------

#include<iostream>
#include<math.h>
#include<graphics.h>
using namespace std;

class pixel
{
           int mx,my,n,x,y,x1,y1,x2,y2,x3,y3,i,j;
           static int poly[10][2];
public :
    void draw(int);
    void xref(int);
    void yref(int);
    void bref(int);
    void rotate(int);
};

int pixel::poly[10][2];

void pixel::draw(int ch)
{
    int g;
    cout<<"\n1.Line\n2.Rextangle\n3.Triangle\nChoice : ";
    cin>>g;
    if(g==1)
    {
        cout<<"\nEnter the co-ordinates of line\nx1 : ";
        cin>>poly[0][0];
        cout<<"\ny1 : ";
        cin>>poly[0][1];
        cout<<"\nx2 : ";
        cin>>poly[1][0];
        cout<<"\ny2 : ";
        cin>>poly[1][1];
        n=2;
        int gd=DETECT,gm;
        initgraph(&gd,&gm,NULL);
        mx=getmaxx()/2;
        my=getmaxy()/2;
        setcolor(WHITE);
        line(mx,0,mx,my*2);
        line(0,my,mx*2,my);
        setcolor(GREEN);
        line(mx+poly[0][0],my-poly[0][1],mx+poly[1][0],my-poly[1][1]);
        delay(1000);
    }
    else if(g==2)
    {
        cout<<"\nEnter the co-ordinates of topmost left point\nx1 : ";
        cin>>poly[0][0];
        cout<<"\ny1 : ";
        cin>>poly[0][1];
        cout<<"\nEnter the co-ordinates of bottommost right point\nx2 : ";
        cin>>poly[2][0];
        cout<<"\ny2 : ";
        cin>>poly[2][1];
        poly[1][0]=poly[2][0];
        poly[1][1]=poly[0][1];
        poly[3][0]=poly[0][0];
        poly[3][1]=poly[2][1];
        n=4;
        int gd=DETECT,gm;
        initgraph(&gd,&gm,NULL);
        mx=getmaxx()/2;
        my=getmaxy()/2;
        setcolor(WHITE);
        line(mx,0,mx,my*2);
        line(0,my,mx*2,my);
        line(mx+poly[0][0],my-poly[0][1],mx+poly[1][0],my-poly[1][1]);
        line(mx+poly[1][0],my-poly[1][1],mx+poly[2][0],my-poly[2][1]);
        line(mx+poly[2][0],my-poly[2][1],mx+poly[3][0],my-poly[3][1]);
        line(mx+poly[3][0],my-poly[3][1],mx+poly[0][0],my-poly[0][1]);
        delay(1000);
    }
    else
    {
        cout<<"\nEnter the co-ordinates of triangle\nx1 : ";
        cin>>poly[0][0];
        cout<<"\ny1 : ";
        cin>>poly[0][1];
        cout<<"\nx2 : ";
        cin>>poly[1][0];
        cout<<"\ny2 : ";
        cin>>poly[1][1];
        cout<<"\nx3 : ";
        cin>>poly[2][0];
        cout<<"\ny3 : ";
        cin>>poly[2][1];
        n=3;
        int gd=DETECT,gm;
        initgraph(&gd,&gm,NULL);
        mx=getmaxx()/2;
        my=getmaxy()/2;
        setcolor(WHITE);
        line(mx,0,mx,my*2);
        line(0,my,mx*2,my);
        line(poly[0][0]+mx,my-poly[0][1],mx+poly[1][0],my-poly[1][1]);
        line(mx+poly[1][0],my-poly[1][1],mx+poly[2][0],my-poly[2][1]);
        line(mx+poly[0][0],my-poly[0][1],mx+poly[2][0],my-poly[2][1]);
        delay(1000);
    }
    if(ch==1)
             xref(n);
    else if(ch==2)
             yref(n);
    else if(ch==3)
             bref(n);
    else
             rotate(n);
    delay(2000);
    closegraph();
}

void pixel::xref(int n)
{
          setcolor(BLUE);
          for(i=0;i<n;i++)
          {
                  if(i>0)
                  {
                        line(mx+poly[i-1][0],my+poly[i-1][1],mx+poly[i][0],my+poly[i][1]);
                  }
                  if(i==n-1)
                  {
                        line(mx+poly[0][0],my+poly[0][1],mx+poly[i][0],my+poly[i][1]);
                  }
          }
}

void pixel::yref(int n)
{
          setcolor(BLUE);
          for(i=0;i<n;i++)
          {
                  if(i>0)
                  {
                        line(mx-poly[i-1][0],my-poly[i-1][1],mx-poly[i][0],my-poly[i][1]);
                  }
                  if(i==n-1)
                  {
                        line(mx-poly[0][0],my-poly[0][1],mx-poly[i][0],my-poly[i][1]);
                  }
          }
}

void pixel::bref(int n)
{
          setcolor(WHITE);
          line(mx,my,mx*2,0);
          setcolor(BLUE);
          for(i=0;i<n;i++)
          {                                  
                  if(i>0)
                  {
                        line(mx+poly[i-1][1],my-poly[i-1][0],mx+poly[i][1],my-poly[i][0]);
                  }
                  if(i==n-1)
                  {
                        line(mx+poly[0][1],my-poly[0][0],mx+poly[i][1],my-poly[i][0]);
                  }
          }
}

void pixel::rotate(int n)
{
    float temp[3][3];
    double angle;
    int t[n][2],r;
    setcolor(BLUE);
    cout<<"\nEnter the point\nx : ";
    cin>>x1;
    cout<<"\ny : ";
    cin>>y1;
    cout<<"\nEnter the angle : ";
    cin>>angle;
    cout<<"\n1.anticlockwise\n2.Clockwise\nChoice : ";
    cin>>r;
    angle=(angle/180)*3.14;
    if(r==1)
    {
            temp[0][0]=cos(angle);
            temp[0][1]=sin(angle);
            temp[1][0]=-sin(angle);
            temp[1][1]=cos(angle);
            temp[2][0]=-x1*cos(angle)+y1*sin(angle)+x1;
            temp[2][1]=-x1*sin(angle)-y1*cos(angle)+y1;
            temp[0][2]=temp[1][2]=0;
            temp[2][2]=1;    
    }
    else if(r==2)
    {
            temp[0][0]=cos(angle);
            temp[0][1]=-sin(angle);
            temp[1][0]=sin(angle);
            temp[1][1]=cos(angle);
            temp[2][0]=-x1*cos(angle)-y1*sin(angle)+x1;
            temp[2][1]=x1*sin(angle)-y1*cos(angle)+y1;
            temp[0][2]=temp[1][2]=0;
            temp[2][2]=1;
    }
    for(i=0;i<n;i++)
    {
        for(j=0;j<2;j++)
        {
            t[i][j]=poly[i][0]*temp[0][j]+poly[i][1]*temp[1][j]+temp[2][j];
        }
    }
   
    for(i=0;i<n;i++)
    {                                  
                  if(i>0)
                  {
                        line(mx+t[i-1][0],my-t[i-1][1],mx+t[i][0],my-t[i][1]);
                  }
                  if(i==n-1)
                  {
                        line(mx+t[0][0],my-t[0][1],mx+t[i][0],my-t[i][1]);
                  }
    }
}

int main()
{
    pixel P;
    int ch;
    do
    {
        cout<<"\n\n\n=======MENU=======\n\n\n1.Reflection about X axis\n2.Reflection about y axis\n3.Reflection about X=Y axis\n4.Rotate about arbitrary point\nPress 0 to exit\nChoice : ";
        cin>>ch;
        if(ch<5 && ch!=0)
        {
                P.draw(ch);
        }
        else if(ch!=0)
            cout<<"\n\n\n***Invalid choice!!!\n\n\n";
    }while(ch!=0);
    return 0;
}


----------------------------------------------------------------------------------------------------------------------------------



Comments

Post a Comment

Popular posts from this blog

Implement C++ program for expression conversion as infix to postfix and its evaluation using stack.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical C25: Implement C++ program for expression conversion as infix to postfix and its evaluation using stack based on given conditions i. Operands and operator, both must be single character. ii. Input Postfix expression must be in a desired format. iii. Only '+', '-', '*' and '/ ' operators are expected. ---------------------------------------------------------------------------------------------------------------------------------- #include<iostream> #include<conio.h> using namespace std; class stack {  public:   char stack_array[50];   int top;   stack()   {     top=-1;   } void push(char symbol) {  if(full())       cout<<"\nStack overflow:\n";     else     { top=top+1;       stack_array[top]=symbol;      } } char pop() {   if(empty())        return('#');         // Return value '#' indica
Read more

Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name.

Second Year Computer Engineering Data Structure Programs: Data Structure Lab: Practical B14: Department of Computer Engineering has student's club named 'Pinnacle Club'. Students of Second, third and final year of department can be granted membership on request. Similarly one may cancel the membership of club. First node is reserved for president of club and last node is reserved for secretary of club. Write C++ program to maintain club member‘s information using singly linked list. Store student PRN and Name. Write functions to a) Add and delete the members as well as president or even secretary. b) Compute total number of members of club c) Display members d) Display list in reverse order using recursion e) Two linked lists exists for two divisions. Concatenate two lists. ------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <string.h> usin
Read more

Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick.

Second Year Computer Engineering Computer Graphics Programs: Computer Graphics Lab: Practical B10: Write C++/Java program for line drawing using DDA or Bresenhams algorithm with patterns such as solid, dotted, dashed, dash dot and thick. ---------------------------------------------------------------------------------------------------------------------------------- #include <iostream> #include <stdlib.h> #include <graphics.h> #include <math.h> using namespace std; int xmax,ymax,xmid,ymid; class Line { public: int x1,x2,y1,y2,ch;        void bss(int x1,int y1,int x2,int y2)           {             int dx,dy,x,y,s1,s2,ex,e,i,flag=0,temp;                         dx=abs(x2-x1);             dy=abs(y2-y1);             x=x1;             y=y1;             putpixel(x+xmid,ymid-y,15);                  if(x2>x1)              { s1=1;           }              if(x2==x1)              { s1=0;     }              if(x2
Read more