Computer-Graphics/BOUNDARY.CPP at master · arpitmaheshwari213/Computer-Graphics · 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
49
50
51
52
53
54
55
56
57
58
#include<graphics.h>
#include<stdio.h>
#include<conio.h>
#include<dos.h>
struct Point{
int x,y;
};
void drawPoly(Point ver[],int n)
{ for(int i=0;i<n;i++)
  {setcolor(BLUE);
   line(ver[i].x,ver[i].y,ver[(i+1)%n].x,ver[(i+1)%n].y);
   }
}
void boundaryFill4(int x, int y, int fill,int boundary){
int current;
current=getpixel(x,y);
if((current!=boundary)&&(current!=fill))
 {putpixel(x,y,fill);
 delay(10);
 boundaryFill4(x+1,y,fill,boundary);
 boundaryFill4(x-1,y,fill,boundary);
 boundaryFill4(x,y+1,fill,boundary);
 boundaryFill4(x,y-1,fill,boundary);
 }
}
void boundaryFill8(int x, int y, int fill,int boundary){
int current;
current=getpixel(x,y);
if((current!=boundary)&&(current!=fill))
 {putpixel(x,y,fill);
 delay(10);
 boundaryFill8(x+1,y,fill,boundary);
 boundaryFill8(x-1,y,fill,boundary);
 boundaryFill8(x,y+1,fill,boundary);
 boundaryFill8(x,y-1,fill,boundary);
 boundaryFill8(x-1,y+1,fill,boundary);
 boundaryFill8(x+1,y+1,fill,boundary);
 boundaryFill8(x+1,y-1,fill,boundary);
 boundaryFill8(x-1,y-1,fill,boundary);
 }
}
void main()
{
int gd=DETECT,gm;
initgraph(&gd,&gm,"C:\\TC\\BGI");
Point polygon[]={{100,100},{100,150},{150,150},{150,80},{170,80},{170,100}},seed={101,101};

 int n=sizeof(polygon)/sizeof(polygon[0]);
 drawPoly(polygon,n);
 putpixel(150,100,BLACKE;    //for testing boundary fill 4 and 8
 putpixel(151,101,BLUE);     //second small semi-polygon not fill in 4connected
 putpixel(149,99,BLUE);      //  get filled in 8 connected method
 boundaryFill4(seed.x,seed.y,RED,BLUE);  //change 4 by 8 and check yourself
 getch();
 closegraph();
}