The Joel on Software Discussion Group (CLOSED)

OK, so I'm a pretty decent software developer, but I'm a complete idiot when it comes to bare-metal types of algorithms.  (i.e. a geek but not a nerd, at least in my conception of my place in the world...)

Now I'm working on a project that has a particular requirement for finding the precise bounds of a grouping of values in a 2-d array (i.e. int[][]).  I need to implement an algorithm identical to that used by graphics applications to support the 'paint bucket fill' operation.  Of course, this kind of algorithm falls right in to the middle of the blind spot I mentioned above, so what I've written so far (while it works fine) is clearly sub-optimal.

So, can anyone kindly direct me to such an algorithm that is known to be good and fast?

There's a (very brief) discussion at:
http://www.siggraph.org/education/materials/HyperGraph/scanline/outprims/polygon6.htm

Searching for "flood fill" in Googlew should get you more information.

-Mark

If you need more than this, you'll get decent results searching for "flood fill".
 http://www.4reference.net/encyclopedias/wikipedia/Flood_fill.html

Try:
http://www.codeproject.com/gdi/QuickFill.asp