This document describes a morphological region filling algorithm. It begins with a binary image X containing a single seed point p set to 1, while all other points are 0. The algorithm then repeatedly dilates X, takes the complement, and intersects with the boundary pixels of the object A until convergence. The final filled region is the union of A and the converged X, containing both the filled interior and original boundary. An example implementation fills holes in a binary coin image by applying this algorithm.