 This breaks the loop and allows the algorithm to continue.For case #4, we need to check the opposite 8-connected corners to see whether they are filled or not.If either or both are filled, then this creates a many-path intersection and cannot be filled.