Algorithm for simulating cell fields. The algorithm simulates the formation of a clone of N cells from a single cell and incorporates cell growth and movement. u[d,d] represents a two dimensional uniform distribution from -d to d (e.g., a cell can move to anywhere within the square with length of the side equals to 2d). d1 and d2 describe how much cells spread apart after cell division. t
corresponds to the average generation time of t
, and t
indicates the average time a cell moves. If the d1 and d2 are the same, large t
and small t
will result a more compact colony, while small t
and large t
will result a sparser colony.