Here you will learn about boundary fill algorithm in C and C++.
Boundary Fill is another seed fill algorithm in which edges of the polygon are drawn. Then starting with some seed any point inside the polygon we examine the neighboring pixels to check whether the boundary pixel is reached. If boundary pixels are not reached, pixels are highlighted and process is continued until boundary pixels are reached.
Also Read: Flood Fill Algorithm in C and C++
4 Connected Region (Image Source)
Following is the algorithm for filling a region in a recursive manner with color specified fill color (f_color) up to a boundary color specified boundary color (b_color)
Algorithm
1. Create a function named as boundaryfill with 4 parameters (x,y,f_color,b_color).
|
1 2 3 4 5 6 7 8 9 10 11 12 |
void boundaryfill(int x,int y,int f_color,int b_color) { if(getpixel(x,y)!=b_color && getpixel(x,y)!=f_color) { putpixel(x,y,f_color); boundaryfill(x+1,y,f_color,b_color); boundaryfill(x,y+1,f_color,b_color); boundaryfill(x-1,y,f_color,b_color); boundaryfill(x,y-1,f_color,b_color); } } //getpixel(x,y) gives the color of specified pixel |
2. Call it recursively until the boundary pixels are reached.
3. Stop.
Program for Boundary Fill Algorithm in C and C++
C Program
|
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 |
#include<stdio.h> #include<graphics.h> #include<dos.h> void boundaryfill(int x,int y,int f_color,int b_color) { if(getpixel(x,y)!=b_color && getpixel(x,y)!=f_color) { putpixel(x,y,f_color); boundaryfill(x+1,y,f_color,b_color); boundaryfill(x,y+1,f_color,b_color); boundaryfill(x-1,y,f_color,b_color); boundaryfill(x,y-1,f_color,b_color); } } //getpixel(x,y) gives the color of specified pixel int main() { int gm,gd=DETECT,radius; int x,y; printf("Enter x and y positions for circle\n"); scanf("%d%d",&x,&y); printf("Enter radius of circle\n"); scanf("%d",&radius); initgraph(&gd,&gm,"c:\\turboc3\\bgi"); circle(x,y,radius); boundaryfill(x,y,4,15); delay(5000); closegraph(); return 0; } |
C++ Program
|
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 |
#include<iostream.h> #include<graphics.h> #include<dos.h> void boundaryfill(int x,int y,int f_color,int b_color) { if(getpixel(x,y)!=b_color && getpixel(x,y)!=f_color) { putpixel(x,y,f_color); boundaryfill(x+1,y,f_color,b_color); boundaryfill(x,y+1,f_color,b_color); boundaryfill(x-1,y,f_color,b_color); boundaryfill(x,y-1,f_color,b_color); } } //getpixel(x,y) gives the color of specified pixel int main() { int gm,gd=DETECT,radius; int x,y; cout<<"Enter x and y positions for circle\n"; cin>>x>>y; cout<<"Enter radius of circle\n"; cin>>radius; initgraph(&gd,&gm,"c:\\turboc3\\bgi"); circle(x,y,radius); boundaryfill(x,y,4,15); delay(5000); closegraph(); return 0; } |
Author Bio:
I am Rahul Maheshwari from India currently pursuing engineering degree in Computer Science. I am passionate about programming and loves to code as much as I can and likes to help people to become better in programming.
Connect with him: Facebook | Linkedin
Comment below if you have doubts or found anything incorrect in above boundary fill algorithm in C and C++.
when we change the values of f_color and b_color the program doesnt work the same..so how should we change the color
boundary colour u have to keep fixed as 15, fill colour u can choose any from 0 to 15.
The program is not working properly for circle with radius more than 45 in Dosbox (Turbo C for windows), in Dev C++ it is working fine for any radius , can somebody tell what changes should be made in turbo c program?
This is an recursive approach. Due to repeated recursion Dosbox runs out of memory & crashes. Use a Stack/Queue to store neighboring pixels to avoid recursion.
when we give radius more than 40 it doesn’t fill color…
This is an recursive approach. Due to repeated recursion Dosbox runs out of memory & crashes. Use a Stack/Queue to store neighboring pixels to avoid recursion.
Can u give the program for 8 connected?
this one also missing a output
how can i implement the code in java. is there a way to do it?