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:
“So having said, a while he stood, expecting
Their universal shout and high applause
To fill his ear; when contrary, he hears,
On all sides, from innumerable tongues
A dismal universal hiss, the sound
Of public scorn.”
—John Milton (1608–1674)