1. Polygon Fill
Flood fill algorithm. The algorithm starts at a pixel and perform a depth first traversal of the adjacent pixels and fills the visited pixel.

2. Polygon Fill
Recursive boundary fill algorithm. The algorithm starts by trying to fill the available row section, then moving to the lower row. In case of upper and lower row available it pushes the upper one to the stack and return from that point after it completes the recently selected section..

3. Polygon Fill
Recursive boundary fill algorithm. The algorithm starts by trying to fill the available row section, then moves to the lower row. In case of upper and lower row available it pushes the upper one to the stack and return from that point after it completes the recently selected section..

4. Filling Non-Simple Polygons?
Non-simple polygon may has self intersection and/or holes

5. The Scan Line Algorithm
Non-simple polygon may has self intersection and/or holes
m0, xi, yi y0
m1, xj, yj y1
m2, xk, yk y2
m3, xl, yl y3