Scanline Fill
The algorithm can be sped up by filling lines. Instead of pushing each potential future pixel coordinate on the stack, it inspects the neighbour lines (previous and next) to find adjacent segments that may be filled in a future pass; the coordinates (either the start or the end) of the line segment are pushed on the stack. In most cases this scanline algorithm is at least an order of magnitude faster than the per-pixel one.
Efficiency: each pixel is checked once.
Read more about this topic: Flood Fill
Famous quotes containing the word fill:
“I have often wondered how they manage to get return envelopes which miss, by one-quarter of an inch, fitting the blank you are supposed to return. They say, “Please fill out and return the enclosed envelope,” and the enclosed envelope is always one-quarter of an inch too small.”
—Robert Benchley (1889–1945)