Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Name: Anadi Thakur Course: BCA 6 B' Roll No: 2101620

    Uploaded by

    Aditya Niwal
    The document contains code for implementing the boundary fill and flood fill algorithms for 8 connected pixels in C. It includes the main function and boundaryfill1 and floodfill4 functions which perform the boundary filling and flood filling respectively by recursively calling the functions for the 8 neighboring pixels.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Name: Anadi Thakur Course: BCA 6 B' Roll No: 2101620

    Uploaded by

    Aditya Niwal
    11 views6 pages
    The document contains code for implementing the boundary fill and flood fill algorithms for 8 connected pixels in C. It includes the main function and boundaryfill1 and floodfill4 functions which perform the boundary filling and flood filling respectively by recursively calling the functions for the 8 neighboring pixels.

    Original Title

    CG Anadi

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains code for implementing the boundary fill and flood fill algorithms for 8 connected pixels in C. It includes the main function and boundaryfill1 and floodfill4 functions which perform the boundary filling and flood filling respectively by recursively calling the functions for the 8 neighboring pixels.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    11 views6 pages

    Name: Anadi Thakur Course: BCA 6 B' Roll No: 2101620

    Uploaded by

    Aditya Niwal
    The document contains code for implementing the boundary fill and flood fill algorithms for 8 connected pixels in C. It includes the main function and boundaryfill1 and floodfill4 functions which perform the boundary filling and flood filling respectively by recursively calling the functions for the 8 neighboring pixels.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 6

    Name: Anadi Thakur

    Course: BCA 6 ‘B’


    Roll No: 2101620

    Q6. WAP to implement Boundary fill algoritm for 8 Connected pixels.

    #include<stdio.h>

    #include<conio.h>

    #include<graphics.h>

    void boundaryfill1(int,int,int,int);

    void main()

    int gd=DETECT,gm;

    int fill,boundary;

    initgraph(&gd,&gm,"c:\\tc\\bgi");

    rectangle(100,100,150,150);

    boundary=getpixel(100,100);

    boundaryfill1(125,125,4,boundary);

    getch();

    void boundaryfill1(int x,int y,int fill,int boundary)

    if(getpixel(x,y)!=boundary && getpixel(x,y)!=fill)

    putpixel(x,y,fill);

    boundaryfill1(x+1,y,fill,boundary);

    boundaryfill1(x,y+1,fill,boundary);

    boundaryfill1(x-1,y,fill,boundary);

    boundaryfill1(x,y-1,fill,boundary);
    boundaryfill1(x+1,y+1,fill,boundary);

    boundaryfill1(x-1,y-1,fill,boundary);

    boundaryfill1(x-1,y+1,fill,boundary);

    boundaryfill1(x+1,y-1,fill,boundary);

    }
    Output
    Name: Anadi Thakur
    Course: BCA 6 ‘B’
    Roll No: 2101620

    Q7. WAP to Implement Floodfill Algorithm for 8 Connected Pixels

    #include<stdio.h>

    #include<graphics.h>

    #include<conio.h>

    void floodfill4(int,int,int,int);

    void main()

    int gd=DETECT,gm;

    initgraph(&gd,&gm,"c://tc//bgi");

    rectangle(50,50,125,100);

    floodfill4(75,70,4,getpixel(75,70));

    getch();

    void floodfill4(int x,int y,int fill, int old)

    if(getpixel(x,y)==old)

    putpixel(x,y,fill);

    floodfill4(x+1,y,fill,old);

    floodfill4(x-1,y,fill,old);

    floodfill4(x,y+1,fill,old);

    floodfill4(x,y-1,fill,old);

    floodfill4(x+1,y+1,fill,old);

    floodfill4(x+1,y-1,fill,old);
    floodfill4(x-1,y+1,fill,old);

    floodfill4(x-1,y-1,fill,old);

    }
    Output

    You might also like