Master Thesis - Hochschule Bonn-Rhein-Sieg

5. Algorithms Master Thesis Björn Ostermann page 79 of 126
After the outline algorithm is finished, the outlined region has to be filled. This is achieved by the
algorithm depicted in Figure 56.
a)
b) c)
Figure 56: Filling principle
The algorithm starts, working on a temporary array, by filling every pixel that is between two outline
pixels of one row and has outlined or filled pixels in the row above. In Figure 56a the light blue pixels
would be filled, because they have a blue-white outline on the left and right and outlined or filled
pixels above.
The pixels would not be filled, if not every pixel above was outlined or filled (see Figure 56b) or if
there was no outline to the left and right (see Figure 56c).