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:
“There was once in man a true happiness of which there now remain to him only the mark and empty trace, which he in vain tries to fill from all his surroundings, seeking from things absent the help he does not obtain in things present.”
—Blaise Pascal (1623–1662)