Skip to main content

2D Basic Transformations such as Translation, Rotation and Scaling in C Programming

#include< stdio.h>
#include< conio.h>
#include< graphics.h>
#include< math.h>

void translate(int,int);
void scale(int,int);
void rotate(float);

void main()
{
 int ch;
 int gd=DETECT,gm;
 int tx,ty,sx,sy;
 float theta;
 initgraph(&gd,&gm,"c:\\tc\\bgi");
 setbkcolor(WHITE);
 setcolor(6);
 outtextxy (100,88,"Object.");
 rectangle(100,250,150,200);

 printf("---MENU---");
 printf("\n 1)Translate\n 2)Scale\n 3)Rotate");
 printf("\nEnter your choice: ");
 scanf("%d",&ch);
 cleardevice();

 switch(ch)
 {
  case 1:
    outtextxy(10,45,"Enter value of tx and ty:");
    scanf("%d %d",&tx,&ty);
    translate(tx,ty);
    break;
  case 2:
    outtextxy(10,45,"Enter the value of sx and sy:");
    scanf("%d%d",&sx,&sy);
    scale(sx,sy);
    break;
  case 3:
    outtextxy(10,50,"Enter the angle for rotation: ");
    scanf("%f",&theta);
    rotate(theta);
  break;
  default: printf("you have enterd wrong choice");
  break;
 }
 getch();
 closegraph();
}

void translate(int tx,int ty)
{
 setcolor(2);
 outtextxy(240,10,"TRANSLATION");
 outtextxy(238,20,"------------");
 rectangle(100,250,150,200);
 rectangle(100+tx,250+ty,150+tx,200+ty);
}

void scale(int sx,int sy)
{
 setcolor(2);
 outtextxy(240,10,"SCALING");
 outtextxy(238,20,"--------");
 rectangle(100,250,150,200);
 rectangle(100*sx,250*sy,150*sx,200*sy);
}

void rotate(float theta)
{
 int x1,x2,x3,x4;
 int y1,y2,y3,y4;
 int ax1,ax2,ax3,ax4,ay1,ay2,ay3,ay4;
 int refx,refy;
 theta=theta*(3.14/180);
 setcolor(2);
 outtextxy(240,10,"ROTATE");
 outtextxy(238,20,"-------");
 refx=100;
 refy=100;

 x1=100;
 y1=100;
 x2=150;
 y2=100;
 x3=150;
 y3=150;
 x4=100;
 y4=150;

 ax1=refy+(x1-refx)*cos(theta)-(y1-refy)*sin(theta);
 ay1=refy+(x1-refx)*sin(theta)+(y1-refy)*cos(theta);

 ax2=refy+(x2-refx)*cos(theta)-(y2-refy)*sin(theta);
 ay2=refy+(x2-refx)*sin(theta)+(y2-refy)*cos(theta);

 ax3=refy+(x3-refx)*cos(theta)-(y3-refy)*sin(theta);
 ay3=refy+(x3-refx)*sin(theta)+(y3-refy)*cos(theta);

 ax4=refy+(x4-refx)*cos(theta)-(y4-refy)*sin(theta);
 ay4=refy+(x4-refx)*sin(theta)+(y4-refy)*cos(theta);
 rectangle(100,150,150,100);
 line(ax1,ay1,ax2,ay2);
 line(ax2,ay2,ax3,ay3);
 line(ax3,ay3,ax4,ay4);
 line(ax4,ay4,ax1,ay1);
}
OUTPUT

Comments

Post a Comment

Popular posts from this blog

First Come First Serve (FCFS) Page replacement algorithm in C Programming

#include #include int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i OUTPUT Enter frame size:3 Enter number of pages:12 Enter page[1]:1 Enter page[2]:2 Enter page[3]:3 Enter page[4]:4 Enter page[5]:1 Enter page[6]:2 Enter page[7]:5 Enter page[8]:1 Enter page[9]:2 Enter page[10]:3 Enter page[11]:4 Enter page[12]:5 page | Frame content -------------------------------------- 1 | 1 -1 -1 2 | 1 2 -1 3 | 1 2 3 4 | 4 2 3 1 | 4 1 3 2 | 4 1 2 5 | 5 1 2 1 | 5 1 2 2 | 5 1 2 3 | 5 3 2 4 | 5 3 4 5 | 5 3 4 ---------------------------...

Deadlock Prevention using Banker’s Algorithm in C Programming

#include #include void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i OUTPUT Enter number of process:5 Enter number of resources:3 Enter total numbers of each resources:10 5 7 Enter Max resources for each process: for process 1:7 5 3 for process 2:3 2 2 for process 3:9 0 2 for process 4:2 2 2 for process 5:4 3 3 Enter allocated resources for each process: for process 1:0 1 0 for process 2:3 0 2 for process 3:3 0 2 for process 4:2 1 1 for process 5:0 0 2 available resources: 2 3 0 Allocated matrix Max need 0 1 0| 7 5 3| 7 4 3 3 0 2| 3 2 2| 0 2 0 3 0 2| 9 0 2| 6 0 0 2 1 1| ...

MVT (Multiprogramming Variable Task) in C Programming

#include #include void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i =pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Allocate page 2 Allocate page 3 page 4 is not allocated due to insufficient memory. External Fragmentation is:64