You can have a complete image colored the actual way and when you fill a certain region with a color, it will replace all the regions that is specified by that color to be filled in. Layman’s terms: User will click on the hand of the OUTLINE That click location will be checked with another … Read more
Just implement a stack of int pairs with an array of some fixed size (maybe the size of the image in pixels or the square root of that, for example) for the stack and track the top with an int. Here is some C# code that implements floodfill non-recursively: private static void Floodfill(byte[,] vals, Point … Read more
the principle is simple, for each empty cell, you must add all the adjacent empty cells. it is also necessary to collect the number of adjacent mines of each cell a) list the 8 adjacent cells, except for the cells placed at the edge this is the prxElm() function in my code b) count the … Read more
All zero-valued pixels in the same connected component as the seed point of the mask are replaced by the value you specify. This value must be added to the flags parameter, left-shifted by 8 bits: uchar fillValue = 128; cv::floodFill(img, mask, seed, cv::Scalar(255) ,0, cv::Scalar(), cv::Scalar(), 4 | cv::FLOODFILL_MASK_ONLY | (fillValue << 8)); A simple, … Read more
The Wikipedia article is pretty good. As long as your grids are small, just about anything will work. Earlier this fall I did some flood filling on 10 megapixel scanned images. (The problem was to remove black edges from book pages that had been scanned on a photocopier.) In that case there are only two … Read more
Somebody ported J. Dunlap’s Queue-Linear Flood Fill Algorithm to android here. I’ve tried it and it’s pretty fast. I’ve modified the copyImage() method which originally makes use of a class called Utilities which the author hasn’t provided. public class QueueLinearFloodFiller { protected Bitmap image = null; protected int[] tolerance = new int[] { 0, 0, … Read more
You can use Queue to remove recursion from floodfill algorithm. Here are some basic ideas: Have a way to mark visited points At the beginning, queue the start point. While the queue is not empty, continue dequeuing its element. And with each element Fill its color and mark just-dequeued point as visited Enqueue unvisited adjacent … Read more
According to the documentation of imfill in MATLAB: BW2 = imfill(BW,’holes’); fills holes in the binary image BW. A hole is a set of background pixels that cannot be reached by filling in the background from the edge of the image. Therefore to get the “holes” pixels, make a call to cvFloodFill with the left … Read more
To create a flood fill you need to be able to look at the pixels that are there already and check they aren’t the color you started with so something like this. const ctx = document.querySelector(“canvas”).getContext(“2d”); ctx.beginPath(); ctx.moveTo(20, 20); ctx.lineTo(250, 70); ctx.lineTo(270, 120); ctx.lineTo(170, 140); ctx.lineTo(190, 80); ctx.lineTo(100, 60); ctx.lineTo(50, 130); ctx.lineTo(20, 20); ctx.stroke(); floodFill(ctx, … Read more