Code-Overflow/Bresenham‘s algorithm at main · Coder-Megha/Code-Overflow · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include<iostream>
#include<graphics.h>
using namespace std;
class pixel
{
public:
 float x0,y0,x1,y1,rd,pk,pk1,p0,x,y;
 void drawCircle(float ,float ,float,float ,float );
 void bresCircle(float , float , float );
}p;
void pixel :: bresCircle(float xc, float yc, float r)
{
 x0=0;
 y0=r;
 pk=3-2*r;
 x=x0;
 y=y0;
 drawCircle(xc,yc,r,x,y);
 while(x<=y)
 {
 x++;
 if(pk<0)
 {
 pk=pk+4*x+6;
 }
 else
 {
 y--;
 pk=pk+4*(x-y)+10;
 }
 drawCircle(xc,yc,r,x,y);
 }
}
void pixel :: drawCircle(float xc, float yc, float r, float x,
float y)
{
 putpixel(xc+x,yc+y,WHITE);
 putpixel(xc-x,yc+y,WHITE);
 putpixel(xc+y,yc+x,WHITE);
 putpixel(xc-y,yc+x,WHITE);
 putpixel(xc+x,yc-y,WHITE);
 putpixel(xc-x,yc-y,WHITE);
 putpixel(xc+y,yc-x,WHITE);
 putpixel(xc-y,yc-x,WHITE);
 delay(50);
}
class point : public pixel
}