While dividing non-clustered cells is straightforward, doing the same for clustered cells is more challenging. To divide non-cluster cell using directional mitosis algorithm we construct a line or a plane passing through center of mass of a cell and pixels of the cell (we are using PixelTracker plugin with mitosis) on one side of the line/plane end up in child cell and the rest stays in parent cell. The orientation of the line/plane can be either specified by the user or we can use CC3D built-in feature to calculate calculate orientation tion of principal axes and divide either along minor or major axis.
With compartmental cells, things get more complicated because: 1) Compartmental cells are composed of many subcells. 2) There can be different topologies of clusters. Some clusters may look “snake-like” and some might be compactly packed blobs of subcells. The algorithm which we implemented in CC3D works in the following way:
We first construct a set of pixels containing every pixel belonging to a cluster cell. You may think of it as of a single “regular” cell.
We store volumes of compartments so that we know how big compartments shold be after mitosis (they will be half of original volume)
We calculate center of mass of entire cluster and calculate vector offsets between center of mass of a cluster and center of mass of particulat compartments as on the figure below:
Figure 25. Vectors and show offsets between center of mass of a cluster and center of mass particular compartments.
We pick division line/plane and for parents and child cells we offsets between cluster center of mass (after mitosis) and center of masses of clusters. We do it according to the formula:
where denotes offset after mitosis from center of mass of child (parent) clusters, is orientation vector before mitosis (see picture above) and is a normalized vector perpendicular to division line/plane. If we try to divide the cluster along dashed line as on the picture below
Figure 26. Division of cell along dashed line. Notice the orientation of
the offsets after the mitosis for child and parent cell will be and as expected because both parent and child cells will retain their heights but after mitosis will become twice narrower (cell with grey outer compartments is a parent cell):
Figure 27. Child and parent (thr one with grey outer compartments) cells after mitosis.
The formula given above is heuristic. It gives fairly simple way of assigning pixels of child/parent clusters to cellular compartments. It is not perfect but the idea is to get approximate shape of the cell after the mitosis and as simulation runs cell shape will readjust based on constraints such as adhesion of focal point plasticity. Before continuing with the mitosis we check if center of masses of compartments belong to child/parent clusters. If the center of masses are outside their target pixels we abandon mitosis and wait for readjustment of cell shape at which point mitosis algorithm will pass this sanity check. For certain “exotic” shapes of cluster shapes presented mitosis algorithm may not work well or at all . In this case we would have to write specialized mitosis algorithm.
We divide clusters and knowing offsets from child/parent cluster center of mass we assign pixels to particular compartments. The assignment is based on the distance of particular pixel to center of masses of clusters. Pixel is assigned to particular compartment if its distance to the center of mass of the compartment is the smallest as compared to distances between centroids of other compartments. If given compartment has reached its target volume and other compartmets are underpopulated we would assign pixels to other compartments based on the closest distance criterion. Altohugh this method may result in some deviation from perfect 50-50 division of compartment volume in most cases after few MCS cells will readjust their volume.
Figure 28. CC3D example of compartmental cell division. See also examples_PythonTutorial/clusterMitosis.
Share with your friends: |