Neel Sanjay Bhatt

SE COMPS-A
Roll NO.07

EXPERIMENT NO.03

AIM:IMPLEMENTATION OF MIDPOINT CIRCLE ALGORITHM

CODE:

#include<stdio.h>
#include<graphics.h>
#include<dos.h>
void main()
{
int gd=DETECT, gm,i,r,x,y;
float p;
printf("\nEnter radius of the circle :");
scanf("%d",&r);
p=(((float)5/4)-r);
initgraph(&gd,&gm,“C:\\TURBOC3\\BGI”);
for(i=0;i<100;i++)
{
putpixel(i+100,100,2);
putpixel(-i+100,100,2);
putpixel(100,100+i,4);
putpixel(100,100-i,4);
}
x=0;
y=r;
while(x<y)
{
if(p<0)
{
p=p+(2*x)+3;
x++;
putpixel(100+x,100-y,3);//x,y
putpixel(100-x,100-y,3);//-x,y
putpixel(100+y,100-x,3);//y,x
putpixel(100+y,100+x,3);//y,-x
putpixel(100+x,100+y,3);//x,-y
putpixel(100-x,100+y,3);//-x,-y
putpixel(100-y,100+x,3);//-y,-x
 putpixel(100-y,100-x,3);//-y,x
}
else
{
p=p+2*(x-y)+5;
x++;
y--;
putpixel(100+x,100-y,3);//x,y
putpixel(100-x,100-y,3);//-x,y
putpixel(100+y,100-x,3);//y,x
putpixel(100+y,100+x,3);//y,-x
putpixel(100+x,100+y,3);//x,-y
putpixel(100-x,100+y,3);//-x,-y
putpixel(100-y,100+x,3);//-y,-x
putpixel(100-y,100-x,3);//-y,x
}
}
delay(20000);
closegraph();
}

OUTPUT:
CONCLUSION:

Hence, we successfully studied and implemented Midpoint Circle Algorithm.