Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!ukma!psuvm.bitnet!psuvmxa!cunyvm!ndsuvm1.bitnet!nu113738
From: NU113738@NDSUVM1.BITNET
Newsgroups: comp.graphics
Subject: Request for Flood Fill Algorithm
Message-ID: <2494NU113738@NDSUVM1>
Date: 8 Jul 89 10:37:32 GMT
Organization: North Dakota Higher Education Computer Network, Fargo, ND
Lines: 18
DISCLAIMER: Author bears full responsibility for contents of this article.

I'm currently working on a TC 2.0 graphics system to replace the TC 2.0
interface.  I'm mainly interested in speed and efficiency.  What I can't
seem to find is an algorithm out there for a good, yet quick flood fill.

I've found dozens of source examples of generalized floods covering an
x1,y1 to x2,y2 retangular area that take obstructions into account, but
I need to find a flood routine that takes and arbitrary x,y coordinate,
and floods to a specified bondary color pixel.

I've messed around a bit with my own implementations, but my recursive
routines are inefficient and use too much memory.

If anyone has any book suggestions or algorithms, I would appreciate the
help.


Jeff Bakke
NU113738 @ NDSUVM1.BITNET