Labeling or Growing a Single Cluster

First look at how sequential component labeling algorithms work. Start with the Wolff algorithm, which ``grows'' a single cluster. Can liken this to the growth of an ant colony, in the following manner:

1. Pick a site at random and place an ant on it.
2. The ant reproduces by placing a child on the four neighboring sites (in 2-d) with probability p.
3. This ``generation'' of ants also looks at each of its four neighbors in turn, and if it is not already occupied, places a child of its own there with probability p.
4. The ant colony continues to grow until the final generation produces no children.