1 Introduction

Cancer cells proliferate at a high rate and can be considered as a dynamic population of agents that grow and divide without constraints (Hanahan and Weinberg 2000) (at least in the early phase of avascular growth). In the present work, we aim to investigate this preliminary stage of a tumor growth. As such, this study could also help in understanding the development of 3D microtumours. Here, we examine a population initially composed of several tens of cells that proliferate to reach several hundreds of cells within a few days. In this situation, the experimental model consists of cancer cells grown in a culture medium containing all the necessary nutrients for their growth and division. The proliferation of the population is restricted to a single layer, which permits the use of simple two-dimensional simulation models for the comparisons. In the proposed simulation model, we do not include a detailed description of the cell cycle and mitosis events. Instead we focus on the role of the orientation of the cell division planes in the morphology of the tumor cells cluster. We aim to investigate how the orientation of cell divisions influences the structure of the cell lineages. In particular, we would like to determine whether cell lineages break up and whether they have different morphologies according to their initial position in the cell population. The impact of the orientation of the division plane on the organization of the population has been suggested from recent studies. In particular, the influence of the geometry of the cell, the influence of neighboring cells and the role of external mechanical forces on the determination of the orientation of the division plane have been studied in Gibson et al. (2011), Minc et al. (2011), Théry and Bornens (2006), Desmaison et al. (2013a), Fink et al. (2011), Thry et al. (2007), Nestor-Bergmann et al. (2014) and Ambrosi and Mollica (2004). In Höhme et al. (2010), the authors studied a model in which mitotic spindle has random orientation and they compare it with a model in which division is subsequent of an attraction mechanism. Recent results also suggest that the orientation of the division plane plays a role in the differentiation of stem cells (Lechler and Fuchs 2005; Wilcock et al. 2007). It has been experimentally observed that oriented cell division can generate cellular diversity and that tissue morphogenesis depends on the control of the direction of cell division. In other words, orientation shapes tissues. Moreover, recent discoveries tend to establish a link between cancer and disorientation of the division plane (Pease and Tirnauer 2011): dysfunction in cells can lead to disorientation and, conversely, disorientation can promote the development of cancer. The above observations lead us to focus on two main questions related to the organization of a growing tumor cell population: what is the impact of the multiplication of cells on the global organization of the entire cell population? Does the orientation of the division plane influence the evolution of the cell population and the organization of its lineages? The comparison of a mathematical model with biological experiments performed in this work shows that indeed a relation exists between division and organization and that lineages are strongly influenced by the initial position of the parental cell inside the population.

There exists a large number of mathematical models in the literature describing cell proliferation and tumor growth. Some recent review papers can be found in Araujo and McElwain (2004), Byrne and Drasdo (2010), Byrne et al. (2006) and Roose et al. (2007). Among the different ways of representing cells, one usually distinguishes between discrete models and continuous models. In a discrete model (Kam et al. 2012; Rejniak and McCawley 2010; Beyer and Meyer-Hermann 2007; Bonabeau 2002; Byrne 2009; Montalenti et al. 1998; Chiorino et al. 2001; Ingham-Dempster et al. 2017; Zhang et al. 2016; Jagiella et al. 2016; Fletcher et al. 2012; Mirams et al. 2012; Kurusawe et al. 2015), each element is treated as a separate entity. This makes the comparison with experiments easy, but the main drawback of this viewpoint is the huge computational cost when dealing with a large number of agents. On the other hand, continuous models (Johnston et al. 2007; Byrne and Preziosi 2003; Byrne et al. 2006; Araujo and McElwain 2006; Bresch et al. 2010; Sherratt and Chaplain 2001), which typically deal with an average density of cells, are more efficient when the system contains a large number of particles. However, it is difficult to establish direct links between the model parameters and the physical measures (Macklin et al. 2009). Comparisons between the two approaches can be found in Schaller and Meyer-Hermann (2006), Byrne and Drasdo (2009), Galle et al. (2009a), while hybrid models which employ both approaches at the same time can be found for instance in Ribba et al. (2006), Zhang et al. (2007), Patel (2001), Di Costanzo et al. (2015) and Di Costanzo et al. (2017).

Many models of the literature tend to be exhaustive in the description of the biological, physical and chemical phenomena. This leads to the introduction of many empirical parameters and makes the interpretation of the results difficult. Our approach is opposite: it relies on a simple mathematical model which focuses on few determinants and attempts to explore some specific questions through comparisons with experiments. This approach permits to explore the influence of any single modeling choice more efficiently and to formulate hypotheses about which mechanisms are associated with given observations. We follow a bottom-up strategy which starts from simple rules and gradually adds complexity into the model until a good fit with the experiments is reached. Rather than quantitative agreement, we look for similar trends between the model and the experiments when some key parameters are varied. Here, we show that the sole growth and division mechanisms are not sufficient to explain the observed lineage morphologies and that additional phenomena must be taken into account in the model in order to reproduce the experimental results. The biological situation we wish to investigate is a small population composed of 20 up to about 500 cells in which proliferation and movement are restricted to a two-dimensional plane. For this specific situation, the best modeling choice is an individual-based models (IBM) (see Drasdo and Höhme 2005; Galle et al. 2009b; Meineke et al. 2001; Palsson 2008; Rejniak 2007 for example). This permits to make the mathematical model reproduce the experiment and to consider objects moving only in a two-dimensional plane. In addition, since we seek to study the impact of the growth of cells and the influence of the orientation of division on the organization of the population, we need to be able to track individual entities. Indeed, a continuous model will not give access to such information. On the other hand, a discrete model on a grid (Anderson et al. 2007; Glazier and Graner 1993; Shirinifard et al. 2009) could introduce artificial bias on the organization of the cells and it will not allow us to explore orientation issues in depth, since the number of possible orientations is limited by the underlying grid (Byrne et al. 2006; Macklin et al. 2009; Deutsch and Dormann 2005).

The mathematical setting chosen is finally the following: cells aggregate spontaneously, grow and divide. After each growth or division event, a mechanical equilibrium between aggregation and cell–cell non-overlapping is supposed instantaneously reached and gives the instantaneous configuration of the population. Thus, motion arises from stresses between neighboring cells (Tambe et al. 2011; Chepizhko et al. 2016; Levine et al. 2001; Shao et al. 2012). This approach is different from more classical models based on introducing a repulsion potential between the cells (Höhme et al. 2010; Byrne and Drasdo 2009; Drasdo and Höhme 2005). Indeed, the temporal scale associated with cell (quasi)-incompressibility is much faster than that involved in the growth of the tumor as a whole. Modeling cell–cell non-overlapping via a repulsion potential requires making these two scales closer than they are in reality (to ensure numerical stability), thereby introducing a bias in the numerical solution. In a forthcoming work (Degond et al. 2017), we intend to document precisely the differences between these two approaches. Since cell–cell non-overlapping is associated with a faster scale than growth an approach based on realizing a mechanical equilibrium at every time step permit to bypass the numerical stability issue. During the time evolution of the system, different lineages are tagged and compared with experimental data as done for instance in Seplveda et al. (2013). Comparisons between the mathematical model and the biological experiments show that a relation exists between geometric determinants of cell, division, and the organization of the cell population and that lineage shapes are strongly influenced by the initial position of the parental cell inside the population.

The paper is organized as follows. In Sect. 2, we discuss the mathematical model and the numerical method adopted. We also discuss the statistical indicators used to measure the results of the numerical simulations, the experimental protocol and the image processing. In Sect. 3, we resume the principal results of the simulations and a first series of comparisons between the model and the experiments are presented and discussed. In Sect. 4, improvements introduced to the model and new comparisons with the data are analyzed. In Sect. 5, conclusions are drawn and future investigations are discussed.

2 Mathematical Model and Experimental Protocol

2.1 Mathematical Model: General Description

Since the roles of division and growth in the lineage organization are at the center of this study, we must be able to track individual cells during time. In order to do that, we use an agent-based mathematical model in which each cell is represented by a discrete entity. In this model, a cell/agent is defined by its center, its radius and its orientation. Only the plasma membrane is described. The details of the intracellular phenomena are omitted. The cell shape is chosen to be a two-dimensional disk which is incompressible and continuously growing in time. The notion of preferred orientation, linked to the alignment of chromosomes during mitosis, necessary to define the division plane, is not inherently modeled by the shape of the agent. Instead it is an internal parameter owned by each agent which may vary with time depending on the chosen division strategy and detailed next. The cell evolution is determined only by the growth and the division laws, respectively, describing the interphase and the mitotic steps of a cell cycle. To reproduce the experimental setting, cells are free to move and have access to all the required nutrients. Cell cycle phases of growth and division alternate continuously; cell cycle checkpoints, G1 phase variability between cells and temporary cell cycle exits are excluded. The interphase is constituted solely of the cell growth phase: G1 , S and G2 phases are combined into a single no-division phase during which growth is assumed to be linear in time. The mitosis trigger occurs as soon as the cell reaches a critical size, which is the only control condition. Conservation of the volume is imposed during the division process. Agents interact by minimizing at each time the global mechanical energy of the system subject to a non-interpenetration constraint modeling the fact that living cells cannot intermingle. This dynamic causes global as well as individual cell movement, which is thus the product of the combined actions of growth and division on the one hand, and the non-overlapping constraint on the other hand. Growth is modeled as a continuous phenomenon except at the time of division, which occurs when a cell reaches approximately twice the volume of a newborn daughter cell. A uniform probability distribution is added to the growth increment over a time step to introduce some randomness in the cell division starting time. When this process starts the mother cell deforms itself in a dumbbell-shaped geometry to give birth to two identical daughter cells. Deformation occurs with total volume kept constant. The duration of mitosis is short compared to the interphase (around one over thirty units of time). Thus, when a division occurs, the other cells stop growing, i.e., we consider mitosis as an instantaneous phenomenon. During division an equilibrium between the mechanical adhesion forces and the non-overlapping constraint determines the state of the system at each instant of time. In order to explore the influence of the orientation of the division plane onto the lineage organization, we consider three different possibilities: divisions occur in (1) a random direction, (2) in the direction of the line joining the origin and the mother cell (radial direction) (3) in the direction orthogonal to the radial direction (tangential direction). Note that we only consider the case where all cells make the same orientation choices for division (i.e., either all choose random, or all choose radial, or all choose tangential direction). We leave the investigation of the more complex case where some cells choose a certain orientation and others a different one for future investigations. Furthermore, in addition to the different division planes, we consider two different strategies. (1) Free orientation strategy: orientation is chosen at the beginning of the division but is free to change during the deformation into a dumbbell-like shape and finally into two daughter cells. This change of orientation is only due to the interactions with neighboring agents through the energy minimization procedure which defines the new configurations. (2) Constrained orientation strategy: Orientation is chosen at the beginning of the division and remains fixed up to the end of the division process. The first strategy, freedom for the orientation plane to change during division, models the situation in which the orientation of the plane of division is a consequence of the instantaneous state of stress at which cells are subjected. The second strategy, fixed orientation during the division, models the fact that in some situations it has been proved that cells are capable to detect their position and consequently to choose their orientation (Lander 2013). At each time step, a minimum of this mechanical energy subject to the non-overlapping constraint is computed. At the beginning of the next time step, cells radii grow and divisions may arise. This induces a disruption of the mechanical equilibrium, and thus a new minimum of the energy is computed. The time unit is chosen in such a way that the mean duration of a cell cycle is 24 time units which corresponds to the 24 h of the real mean duration of a cycle for the type of cells experimentally considered. The final time of the simulation is 72 time units which corresponds to an average of three cell cycles. The time step between two new equilibrium configurations is 0.25 time units. This leads to a radius growth of 1/100 in one time step with respect to its initial size. This means that the change in configuration of the cellular aggregate changes very slowly in one time unit. Figure 1c, d shows a typical result of the simulation of the described model. To ease the interpretation of the results, the spherical cell shape is replaced by a polygonal one following a Voronoï tessellation of the cell centers, detailed in Sect. 2.4. This simplifies the definition of the geometrical characteristics of the cellular aggregates and facilitates the localization of the neighboring cells. Figure 1a, b illustrates the initial and the final phases of the proliferation and monitoring of the lineages. The cells tracking procedure is described in Sect. 3.

Fig. 1
figure 1

(Color figure online) Monitoring of cell lineages in a proliferating cell population. Top images a, b are experimental data obtained through video-microscopy monitoring of a HCT116 colon cancer cells population at time 0 (a) and 72 h (b). Lineages are identified with colorful stickers that have been added after image segmentation and time-lapse analysis. Bottom images c, d illustrate numerical results: an example of the results of a numerical simulation, c initial state and d final state. Cells are represented by using the Voronoï diagram which permits an easier definition of the concept of neighboring cells and periphery of the population and of the single lineage. The same color indicates cells of the same lineage

2.2 Detail on the Model

Rules for Cells Positioning As already stated, each cell is described by a 2D incompressible disk with a center positioned at

$$\begin{aligned} X_i(t)=(x_i(t),y_i(t)), \end{aligned}$$

a radius \(R_i(t)>0\) and an orientation \(\omega _i(t)\in \mathbb {S}^1\) (the set of two-dimensional vectors with unit length) depending on time t. In this setting, we use \(\xi (t)\) to denote the vector whose elements are the positions of the cells, i.e., \(\xi (t)=(X_1(t),X_2(t),\ldots ,X_{N(t)}(t))\), while \(\rho (t)\) is the vector whose elements are the radii of the cells, i.e., \(\rho (t)=(R_1(t),R_2(t),\ldots ,R_{N(t)}(t))\). The number of cells at time t is denoted by N(t). Each cell belongs to a lineage \(\ell _i\) which defines the developmental history of a given initial mother cell and which does not evolve with time. What evolves in time is the number of cells \(N_{\ell _i}(t)\), belonging to a given lineage \(\ell _i\), due to mitosis.

The impenetrability condition between two cells i and j is expressed by an inequality constraint \(\phi _{ij}\) with a suitable function \(\phi _{ij}\) which expresses the fact that two cells should not overlap. Thus, an admissible configuration \(\mathcal A(t)\) for the system is a set of positions \(\xi (t)\) such that \(\phi _{ij}(\xi (t),\rho (t))\le 0\) for all possible indices i and j:

$$\begin{aligned} &\mathcal A(t)=\{ \xi (t)\in (\mathbb {R}^2)^{N(t)} \ | \ \forall i,j\in [1,N(t)], \nonumber \\&\quad i\ne j, \phi _{ij}(\xi (t),\rho (t))\le 0\}. \end{aligned}$$
(1)

The global adhesion potential is expressed by a function

$$\begin{aligned} W:(X_1(t), X_2(t),\ldots ,X_{N(t)}(t))\rightarrow \sum _{i=1}^{N(t)} V(X_i(t)) \end{aligned}$$
(2)

where \(X_i(t)\rightarrow V(X_i(t))\) is a convex function on \(\mathbb {R}^2\). The instantaneous configuration at time t is then given by a minimum \(\xi ^*(t)\) of the potential W under the constraint that \(\xi ^*(t)\) belongs to the set of admissible configurations \(\mathcal A(t)\), i.e.,

$$\begin{aligned} \xi ^*(t)=\text {argmin}_{\xi (t)\in \mathcal A(t)} W(\xi (t)). \end{aligned}$$
(3)

In this setting, the non-overlapping condition is defined by \(\phi _{ij}(\xi (t),\rho (t))=(R_i(t)+R_j(t))^2-|X_i(t)-X_j(t)|^2\), where \(|X_i(t)-X_j(t)|^2=(x_i(t)-x_j(t))^2+(y_i(t)-y_j(t))^2\) is the Euclidean distance on \(\mathbb {R}^2\) between cell located at \(X_i(t)\) and cell located at \(X_j(t)\). The potential function models the trend of the cells to regroup themselves isotropically around a given position chosen to be the origin of the coordinate system. The potential function we consider is quadratic \(V_Q(X_i(t))=x_i^2(t)+y_i^{2}(t)\). This choice models the situation in which at the center of the cellular aggregate cells are more necrotic and consequently they are probably less able to build up connection bridges with their neighbors.

Fig. 2
figure 2

Different steps of the division process. From one mother cell on the left, at initial time \(t=\tau _0\), up to two daughter cells on the right at the end of the process \(t=\tau _f\)

Growth Law We introduce the size of a new born cell \(R_{\min }\), the size of a cell just before mitosis \(R_{\max }\) and \(T_\mathrm{G}\) the mean duration of the growth phase. Even though the model is two-dimensional, we consider cells as tridimensional structures whose volumes grow linearly in time. Thus the growth law of the i-th cell is given by

$$\begin{aligned} R_i^3(t)=R^3_{\min }+(1+\gamma )\frac{R^3_{\max }-R^3_{\min }}{T_g}t \end{aligned}$$
(4)

where \(\gamma \) is a random variable sampled from an uniform distribution with support on \([-\alpha ,\alpha ]\). Once a cell reaches a radius \(R(t)\ge R_{\max }\), it starts to divide into two daughter cells. Equation (4) is discretized in small time steps \(\Delta t\). After a time step cell growth leads to the violation of non-overlapping constraints. Thus a new energy minimum must be computed through (3) resulting in a repositioning of the cells. Then a new growth step is performed followed by a repositioning step. The cycle of growth and repositioning is repeated until one cell starts to divide.

Division Rules The initial orientation \(\omega _{i_0}\) of the division plane of the cell \(C_i\) is random, radial or tangential. The radial and tangential directions are computed relative to the origin supposed to be the center of the tumor. The division process starts when a cell \(C_i\) reaches a size \(R_{i_0}(t)\ge R_{\max }\) at time t. The process is considered as discrete in time and at each time step the disk which describes the mother cell stretches apart in a peanut like shape until the final separation in two daughter cells as shown in Fig. 2. During this process, the volume is kept constant equal to the volume of the mother cell. At each discrete instant of time, \(\tau _k, \ k\in [1,f]\) (where f is the total number of intermediate steps in the division process) a new equilibrium of the whole system is computed by solving (3) with a modified set of admissible configurations \(\mathcal A(\tau _k)\) (at step \(\tau _k\)) as described below. When the mitosis comes to an end, each daughter cell has reached half the size in volume of the mother cell. Moreover, they have the same size and shape and their position is symmetric with respect to the division plane. The orientation of the division plane is described by the unit vector \(\omega _i(\tau _k), \ \forall i\). Since the division process is much faster than the cell cycle, we make the hypothesis that two cells cannot divide at the same time and that during division the other cells do not grow.

Let \(\omega _{i_0}(t)\) the orientation of the division plane of the mother cell when the division starts, \((x_{i_0}(t),y_{i_0}(t))\) its coordinates and \(\ell _{i_0}\) its lineage. Then, initially, the two daughter cells occupy the same location in space as the mother cell, i.e., \((x^+(\tau _0),y^+(\tau _0))=(x^-(\tau _0),y^-(\tau _0))=(x_{i_0}(t),y_{i_0}(t))\); they share the same orientation \(\omega ^+(\tau _0)=\omega ^-(\tau _0)=\omega _{i_0}(t)\) and they belong to the same lineage \(\ell ^+(\tau _0)=\ell ^-(\tau _0)=\ell _{i_0}\), where the upper indices \(+\) and − refer to the two daughter cells and the \(i_0\) index to the mother cell. During division the lineage of the two daughters remains unchanged while the two radii \(R^+(\tau )\) and \(R^-(\tau )\) are functions of the time during division \(\tau \) (which is rather a degree of completion of the division process), and are such that the initial volume of the mother cell is preserved in time. During the division process the real time variable t is kept constant. In particular, at the end of the process the two radii are such that \(R^+(\tau _{f})=R^-(\tau _{f})=R_{i_0}(t)/\root 3 \of {2}\). The transformation is parametrized by a function \(\tilde{h}(\tau _k)=R_{i_0}-k\frac{R_{i_0}}{f}\) where for each step \(\tau _k\), the \(R^\pm (\tau _k)\) are obtained by solving the following equation

$$\begin{aligned} R^\pm (\tau _k)^3-\frac{3\tilde{h}(\tau _k)^2}{4}R^\pm (\tau _k)+\frac{h(\tau _k)^3}{4}-\frac{R_{i_0}^3(t)}{2}=0, \end{aligned}$$

which expresses the conservation of volume during the division process since the volume of a daughter cell is

$$\begin{aligned} \mathcal {V}^\pm (\tau _k)=\frac{\pi }{3}\left( R^\pm (\tau _k)^3\right) -3\tilde{h}(\tau _k)^2 R^\pm (\tau _k)+\tilde{h}(\tau _k)^3) \end{aligned}$$

at time \(\tau _k\) while \(\mathcal {V}_{i_0}(t)=2\mathcal {V}^\pm (\tau _k)\) with \(\mathcal {V}_{i_0}(t)\) the volume of the mother cell at time t before the division starts. This value then defines the new positions through

$$\begin{aligned} {\left\{ \begin{array}{ll} x^\pm (\tau _{k+1}) = \frac{x^+(\tau _k)+x^-(\tau _k)}{2}\pm (R^\pm (\tau _k)-\tilde{h}(\tau _k))\cos (\omega (\tau _k)) \\ y^\pm (\tau _{k+1}) = \frac{y^+(\tau _k)+y^-(\tau _k)}{2}\pm (R^\pm (\tau _k)-\tilde{h}(\tau _k))\sin (\omega (\tau _k)),\\ \end{array}\right. } \end{aligned}$$

since the two new born cells are placed along the normal vector direction to the plane of division at the distance \(R^\pm (\tau _k)-\tilde{h}(\tau _k)\) from this plane. Once the new positions are computed, the non-overlapping constraint is likely to be violated. A new minimal energy configuration \(\xi ^*(\tau _{k+1})\) must be computed at step \(\tau _{k+1}\) solving (3). Here the definition of the set of admissible configuration is different from (1) and incorporates equality constraints \(\tilde{\phi }_{ij}\) associated with the maintenance of the peanut shape when the pair (ij) corresponds to two daughter cells, i.e., \((i,j)=(i_+,i_-)\). In addition in the case of fixed orientation strategy another constraint is added to the system which imposes \(\omega ^\pm (\tau _{k+1})=\omega ^\pm (\tau _{k}), \ \forall k\), which means that the dividing cells do not change their orientation during the repositioning. By contrast, in the free orientation case, \(\omega ^\pm (\tau _{k+1})\ne \omega ^\pm (\tau _{k})\), i.e., no constraint is imposed on the new orientation at step \(\tau _k\). This new constraints are defined in 2.3.

2.3 Numerical Solution of the Model

We now detail the numerical method used to solve our model.

The general structure of the algorithm is the following

  1. (a)

    Initialization

  2. (b)

    At each time step

    1. (i)

      Growth step.

    2. (ii)

      Test on size of the cell, cell by cell. If the threshold size is reached, a division occurs.

    3. (iii)

      For each mitosis up to the final division

      1. 1.

        Partial division.

      2. 2.

        Positioning step.

      3. 3.

        If necessary, depending on the chosen orientation strategy, orientation update.

    4. (iv)

      Positioning step.

  3. (c)

    Statistical quantifiers computation.

The computation of the statistical quantifiers is detailed in the next section.

Positioning Step We discuss now step \(b)-(iv) \). In order to find a solution to the minimization problem \(\xi ^*(t)=\text {argmin}_{\xi (t)\in \mathcal A(t)} W_Q(\xi (t))\), where \(W_Q\) is the global adhesion potential relative to the quadratic choice of the potential function \(V_Q\), we construct a method based on the Uzawa algorithm (Arrow et al. 1958). Given N(t) cells, the number of constraint functions \(\phi _{ij}(\xi (t),\rho (t))\) due to the non-overlapping condition is \(M=N(t)(N(t)-1)/2\). Then, the algorithm consists in finding a saddle point of the Lagrangian function \(\mathcal L_Q (\xi (t),\lambda (t)): (\mathbb {R}^2)^{N(t)}\times \mathbb {R}^M\rightarrow \mathbb {R}\) defined by

$$\begin{aligned} \mathcal L_Q (\xi (t),\lambda (t))= & {} W_Q(\xi (t))\nonumber \\&+\sum _{1\le i\le j\le N(t)}\lambda _{ij}(t)\phi _{ij}(\xi (t),\rho (t)), \ \forall (\xi (t),\lambda (t)), \end{aligned}$$
(5)

where the \(\lambda _{ij}\) are called the Lagrange multipliers. The algorithm constructs a sequence of approximate values \((\xi (t)^{(p)},\lambda (t)^{(p)})_p\) such that \(\xi (t)^{(p)}\rightarrow \xi (t)^*\), when \({p\rightarrow \infty }\). Starting from an initial guess \((\xi (t)^{(0)},\lambda (t)^{(0)})\), the method reads as

$$\begin{aligned} {\left\{ \begin{array}{ll} \xi ^{(p+1)} =X^{(p)}-\beta \nabla _x\mathcal L_Q\left( \xi ^{(p)},\lambda ^{(p)}\right) , \\ \phi ^{(p+1)}_{ij} =\phi _{ij}\left( \xi ^{(p+1)}\right) , \ \forall \ i,j\in [1,N], \ i<j, \\ \lambda ^{(p+1)}_{ij} = \max \left( 0,\lambda ^{(p)}_{ij}+\mu \phi ^{(p)}_{ij}\right) , \forall \ i,j\in [1,N], \ i<j,\\ \end{array}\right. } \end{aligned}$$

where \(\beta \) and \(\mu \) are numerical parameters and where the dependence on t has been omitted for simplicity and will also be omitted in the sequel of this paragraph if not strictly necessary for comprehension. After some computations, the first equation of the above system can be rewritten for \(k\in [1,N]\) as

$$\begin{aligned} X^{(p+1)}_k =(1-2\beta )X_k^{(p)}+2\beta \sum _{j=1}^{N}\lambda ^{(p)}_{kj}\left( X_k^{(p)}-X_j^{(p)}\right) , \end{aligned}$$

which clarifies the role of the numerical parameter \(\beta \) in the scheme; it is related to the displacement of the cells during the search of an equilibrium position. Two stopping criteria, which need to be satisfied at the same time, are used in order to advance to the next step. They are based on measuring the following quantities

$$\begin{aligned} \varepsilon ^{(p+1)}_\phi= & {} \max _{\begin{array}{c} 1\le k\le N \\ 1\le l\le k-1 \end{array}}\left( \phi _{lk}^{(p+1)}\right) ,\\ \varepsilon ^{(p+1)}_W= & {} \left| \frac{W_Q^{(p+1)}(\xi )-W_Q^{(p)}(\xi )}{W_Q^{(p)}(\xi )}\right| . \end{aligned}$$

Then new equilibrium state is considered to be valid if \(\varepsilon ^{(p+1)}_\phi < tol _\phi \) and \(\varepsilon ^{(p+1)}_W<tol _W\) where \(tol _\phi \) and \(tol _W\) are two tolerances the values of which are given below. These criteria permit to control the largest overlapping permitted between the cells and to exit the algorithm when two consecutive values of the total mechanical energy of the system are very close to each other, indicating that a saddle point is likely to have been reached. Finally, the parameter \(\mu \) is related to the speed at which the constraints are updated.

In order to reach a solution to the minimization problem as fast as possible, an adaptive \(\beta \) has been chosen which depends on the number of cells considered. In practice, \(\beta =3 \ 10^{-4}\) for \(1\le N\le 100\), \(\beta =3 \ 10^{-5}\) for \(100\le N\le 300\) and \(\beta =6 \ 10^{-6}\) for \(300\le N\le 500\), while \(\mu \) is kept fixed to \(\mu =100\). This reflects the observation that the Lagrange multipliers values grow with the number of cells N. Consequently, the value of \(\beta \) should diminish when N grows in order to avoid too large displacements of the cells which may lead to saddle points very far from the initial configuration and thus unrealistic. However, it may happen that when constraints are strongly violated, these choices for \(\beta \) are not sufficient to prevent ejection of cells from the aggregate. This is measured by computing the distance traveled by a cell between two consecutive steps (p) and \((p+1)\) of the minimization algorithm. If this distance goes beyond a fixed tolerance \(tol _X\), this is repaired by repeating the positioning algorithm with a choice of \(\beta \) which avoids too large displacements. Details on the value used for \(tol _X\) are given below.

Growth Step Step \((i) \) consists of the simple implementation of the growth law discussed in the previous section. Given the parameters \(R_{\min }\), \(R_{\max }\), \(\gamma \), \(T_\mathrm{G}\) and the time step \(\Delta t\), we just sample a random number u between \([-\alpha ,\alpha ]\) and we compute \(R_i(t)=\left( R^3_{\min }+(1+\gamma )\frac{R^3_{\max }-R^3_{\min }}{T_g}\Delta t\right) ^{1/3}\). After the growth, in general, an overlapping between cells is produced which is resolved by the repositioning step described in Sect. 3.1.

Division Step We assume that the cell \(C_{i_0}\) is ready to start the division, i.e., \(R_{i_0}(t)\ge R_{\max }\). For each simulation, we fix the number of steps of the division process \(k=[1,f]\), the initial direction \(\omega _{i_0}(t)\) of the division plane and the division strategy. As soon as the cell begins its division, the cell \(C_{i_0}\) is replaced by two new cells. The algorithm can be summarized as follows. For each \(\tau _k,\ k\in [1,f]\), compute \(\tilde{h}(\tau _k)=R_{i_0}(t)-k\frac{R_{i_0}(t)}{f}\), the radii \(R^\pm (\tau _k)\), the new positions \((x^\pm (\tau _{k+1}),y^\pm (\tau _{k+1}))\), where the variable t is fixed during all the division process. This series of actions causes the cells to partially overlap with their neighbors. This is corrected by a new application of the positioning algorithm.

The additional constraints imposed by the mitosis are, for both free and fixed orientation strategies, the change in the non-overlapping constraint between the cells is changed into an equality constraint between the two daughter cells (indexed by \(i^+,i^-\)) which, for the iteration (p) of the minimization algorithm relative to the generic division step \(\tau _k\), reads as follows:

$$\begin{aligned} \phi _{i^+i^-}^{(p)}=4(R_{i_0}-\tilde{h})^2-\left( x^{(p)}_{i^+}-x^{(p)}_{i^-}\right) ^2-\left( y^{(p)}_{i^+}-y^{(p)}_{i^-}\right) ^2, \end{aligned}$$

while the corresponding Lagrange multiplier is updated accordingly to \(\lambda _{i^+i^-}^{(p)}=\lambda _{i^+i^-}^{(p-1)}+\mu \phi _{i^+i^-}^{(p)}\) and where the dependences on \(\tau _k\) and t have been omitted for simplicity. In the constrained strategy case, two additional constraints should be added to the positioning algorithm to take into account that \(\omega ^\pm (\tau _k)\) remains constant equal to \(\omega _{i_0}(t)\) for all \(k\in [1,f]\). They read

$$\begin{aligned} \phi _{1}^{(p)}= & {} \left( x^{(p)}_{i^+}-x^{(p)}_{i^-}\right) \sin (\omega ^\pm )-\left( y^{(p)}_{i^+}-y^{(p)}_{i^-}\right) \cos (\omega ^\pm )\\ \phi _{2}^{(p)}= & {} -\left( x^{(p)}_{i^+}-x^{(p)}_{i^-}\right) \sin (\omega ^\pm )+\left( y^{(p)}_{i^+}-y^{(p)}_{i^-}\right) \cos (\omega ^\pm ), \end{aligned}$$

while the new positions of the two daughters cells take into account these constraints through the corresponding Lagrange multipliers \(\lambda _1^{(p)}\) and \(\lambda _2^{(p)}\) as follows:

$$\begin{aligned} {\left\{ \begin{array}{ll} \tilde{x}_{i^\pm }^{(p+1)} =x_{i^\pm }^{(p+1)}\mp \beta (\lambda _1\mp \lambda _2)\sin (\omega ^{\pm }), \\ \tilde{y}_{i^\pm }^{(p+1)} =y_{i^\pm }^{(p+1)}\pm \beta (\lambda _1\pm \lambda _2)\cos (\omega ^{\pm }), \\ \end{array}\right. } \end{aligned}$$

where \(x_{i^\pm }^{(p+1)}\) and \(y_{i^\pm }^{(p+1)}\) are the positions computed during the iteration \((p+1)\) of the positioning algorithm without divisions and where once again dependence on \(\tau _k\) and t are omitted.

Initialization and Numerical Parameters The initialization is done by inserting \(N_0\) cells in the computational domain with radius \(R_{\min }\), at a random location, each cell defining a different lineage \(\ell _i, \ i=[1,N_0]\). Then, a positioning step finds a first saddle point of the Lagrangian function \( \mathcal L_Q (\xi (t=0),\lambda (t=0))\) which furnishes the initial positions of the cells in the tumor.

We list now all numerical values given to the parameters. We distinguish the model parameters listed in Table 1 from the numerical parameters listed in Table 2. In particular, considering Table 1, the choice of \(N_0\) represents the effective number of initial cells used in average in the experiments. In the same spirit, \(T_\mathrm{G}\) and \(T_{\max }\) are also chosen to be as close as possible to experimental values. The HCT116 line used in the experiments has a cycle of an average duration of 24 h and they are typically tracked up to three generation times. Then cell cycle can vary from 18 to 30 h which justifies the choice of \(\gamma \). The value \(R_{\min }\) sets a reference value. This choice fixes consequently \(R_{\max }\). The ratio between the minimal and the maximal radii assumed by the cells corresponds to the average ratio of the HCT116 line. Finally, the value f (number of steps during the division process) is chosen to avoid too large cell overlapping during the division process. Concerning the numerical parameters, the time step is chosen to guarantee small enough cell size increments which avoids too large cell overlapping before repositioning. The values assigned to \(\beta \) have been already discussed in Sect. 3.2 together with \(\mu \). The value chosen for \(\text {tol}_W\) is directly related to the values of \(\beta \). The tolerance \(\text {tol}_\phi \) is chosen to permit only very small overlaps (of the order of \(5 \times 10^{-2}\) for values of the radius R between \(R_{\min }\) and \(R_{\max }\)). The value of \(\text {tol}_X\) detects too large displacements of cells (of the order of twice the radius \(R_{\min }\)). For the choice of the numerical parameters, we refer to Peurichard et al. (2017) where an extensive study is reported. Since minima of the mechanical energy subjected to non-overlapping constraints are not unique, the numerical parameters are chosen such that the algorithm selects the closest configuration to that of the previous time step.

Table 1 Model parameters
Table 2 Numerical parameters

2.4 Statistical Indicators

To get insight into both the experimental and the numerical results, we develop several indicators to measure the characteristics and the morphologies of the single lineages or of the whole population.

Fig. 3
figure 3

Left (initial step) and middle left (final step): typical result of a simulation without the Voronoï diagram. Middle right (initial step) and right (final step): representation of the solution by the Voronoï diagram

The Voronoï Diagram In Fig. 3 is reported a typical result of a simulation. The left picture shows the initialization after the first positioning phase, with \(N_0=50\) cells, while the right picture shows the solution at \(T_{\max }\) which corresponds to a situation with about \(N=400\) cells. This representation of the solution has several limitations due to the difficulty in defining the notions of cell neighborhood, perimeter and area. In order to overcome this problem, we use a modified Voronoï diagram representation. This representation is introduced for statistical analysis purposes only. It does not play any role in the cell dynamics. This approach is frequently used in the context of growing cell populations, see for instance (Osborne et al. 2010; Fletcher et al. 2014; Bi et al. 2016) where this method is used to determine the interaction forces between two cells. We recall some basics about the Voronoï diagram in the present setting. A Voronoï site is defined as a point \(p_i\) belonging to a predefined subset \(S = \{p_i | 1 \le i \le n\}\) of \(\mathbb {R}^2\). A Voronoï region relative to the site \(p_i\in S\) is a subset \(\mathcal {R}_i\) of \(\mathbb {R}^2\) such that \(\mathcal {R}_i=\{x\in \mathbb {R}^2|\forall j\ne i, d (x,p_i)\le d (x,p_j)\}\), where \( d (\cdot ,\cdot )\) denotes the Euclidean distance on \(\mathbb {R}^2\). A Voronoï diagram for S is the set of regions \(\mathcal {R}_i\) for \(p_i \in S\), i.e., \(\cup _{i=1}^{n}[\mathcal {R}_i]\). Thus, given a set of sites S, the Voronoï diagram partitions the plane by which site is the closest. Two sites \(p_i\) and \(p_j\) are considered as neighbors if \(\mathcal {R}_i\) and \(\mathcal {R}_j\) share a common edge. The intersection of three regions, if not empty, is called a Voronoï vertex or node.

In order to use this representation in our model, we define the Voronoï sites as being the cell centers, i.e., \(S=\{X_i | 1 \le i \le N\}\). But this leads to a problem at the boundary of the cellular aggregate, since the tumor does not occupy the entire plane. The Voronoï regions corresponding to these outer sites are consequently unbounded. To overcome this problem, we add fictitious sites on the borders of the population. These additional sites are located on the polygon whose boundaries are the edges of the convex hull of the tumor slightly enlarged by dilation. More precisely, given a small \(\delta >0\) and \(\mathcal {P}\) the polygon obtained by enlarging the boundaries of the convex hull by an increment \(\delta \), we place n additional sites equally spaced along the segment of \(\mathcal {P}\), where n corresponds to the number of outer sites. The result of this procedure leads to Fig. 3 on the middle right and right where the Voronoï diagram has been traced for the same situation as on the left and middle left. In this figure, the Voronoï regions related to the fictitious sites are not represented. Now, the definitions of area, perimeter and neighborhood of cells or groups of cells are easier even if it should be stated that these quantities in the passage from the sphere representation to the Voronoï one do not remain constant. We will use the same Voronoï approach for the experimental data to have similar definitions of neighborhoods, areas and perimeters in the experimental and numerical results.

Diagnostic Definitions One of the main questions we address is the influence of the orientation of the division plane during mitosis on the morphology of the lineages. We consider all descendants of a given ancestor cell present at the initial time and store this information in the lineage \(\ell _i, \ i=[1,N_0]\). Thus, if cell \(C_i\) is present at the initial time, then \(\ell _i = i\); otherwise, when a cell is created its \(\ell _i\) becomes the lineage of its mother cell. To define diagnostics, we use several concepts of graph theory. We briefly recall them. A graph G is an ordered pair comprising a set of points or vertices and a set of edges or links where an edge is related with two vertices and two vertices of the graph may or may not be connected by a link. A chain in G is a finite sequence of vertices connected by links with possible repetitions. A cycle is a closed chain. We are now ready to introduce some definitions:

Neighboring Cells Two cells \(C_i\) and \(C_j\) are said to be neighbors if their Voronoï regions \(R_i\) and \(R_j\) share a common edge.

Graph of N Cells The set of all cells is a graph where the vertices are the cells centers.

Connected Set of Cells The cells \(C_{i_1}, C_{i_2},\ldots ,C_{i_p}\) are said to be connected when the subgraph induced by these cells is a connected graph.

Connected Component of a Lineage A connected component of a lineage is a connected component of the subgraph generated by the cells of the same lineage.

Cell Cycle A cell cycle is a finite sequence of cells corresponding to a cycle in the graph. In other words, for all \(k\in [1,p+1]\), \(C_{i_k}\) and \(C_{i_k+1}\) are neighbors and \(C_{i_{p+1}} = C_{i_1}\).

Cell Polygon Associated with a Cell Cycle Let \(p\ge 3\) and a cell cycle \(C_{i_1}, C_{i_1},\ldots ,C_{i_{p+1}}\). The line passing from the centers of the cells \(X_{i_1}, X_{i_2},\ldots , X_{i_{p+1}}\) forms a polygon which is called the cell polygon associated to \(C_{i_1}, C_{i_1},\ldots ,C_{i_{p+1}}\).

Boundaries of a Set of Connected Cells Given a set of connected cells, the boundary is defined as a cell cycle whose associated cell polygon contains all cells of the connected set. This polygon is called the boundary polygon.

Perimeter and Area of a Set of Connected Cells Let us consider a set of connected cells with \(p\ge 1\) and its boundary denoted by \(C_{i_1},C_{i_1},\ldots ,C_{i_{p+1}}\). The perimeter of this array of cells is defined as the perimeter of the cell polygon associated to \(C_{i_1}, C_{i_1},\ldots ,C_{i_{p+1}}\). It is given by \(\mathcal {P}=\sum _{k=1}^pd (C_{i_k},C_{i_{k+1}})\). The area of this set is defined as the area of the cell polygon. It is given by \(\mathcal {A}=\frac{1}{2}\left| \sum _{k=1}^p(x_{i_{k}}y_{i_{k+1}}-x_{i_{k+1}}y_{i_{k}})\right| \).

Convex Hull of a Set of Cells The convex hull a set of cells is defined as the convex hull of the point cloud consisting of all the cell centers.

We are now ready to define the statistical indicators used for studying the morphology of the cellular aggregate.

(1) Sphericity of the Population ratio between the area and the perimeter squared of the entire cell population: \(R_1=\frac{4\pi \mathcal {A}}{\mathcal {P}^2}\) where \(R_1\in [0,1]\). R is one when the boundary of the population is a perfect circle.

(2) Convexity of the Population ratio between the area \(\mathcal {A}\) of all cells and \(\mathcal {A}_{conv }\), the area of their convex hull: \(R_2=\frac{\mathcal {A}}{\mathcal {A}_{conv }}, \ R_2\in [0,1]\). Its value is one when the boundary of the population coincides with the boundary of its convex hull.

(3) Sphericity of a Lineage for each connected component (of at least two cells) of a lineage, ratio between the area and the perimeter squared of this connected component: \(R_3=\frac{4\pi \mathcal {A}}{\mathcal {P}^2}\) where now \(\mathcal {P}\) and \(\mathcal {A}\) are, respectively, the perimeter and area of the boundary polygon of the considered connected component.

(4) Lineage Fragmentation number of connected components in which a lineage is split: \(R_4\). It permits to understand whether the cells of the same lineage tend to remain grouped or to scatter.

(5) Size of the Fragments of a Lineage Size of a connected component of a lineage. It counts the number of cells in a connected component of a given lineage (\(R_5\)).

(6) Lineage Orientation Orientation direction for a given lineage \(R_6\). The main direction of orientation is computed by using the inertia matrix of the cells composing the lineage.

Inertia Matrix Let \(p\ge 2\) and for \(k\in [1,p]\), \(X_{i_{k}}=(x_{i_{k}}, y_{i_{k}})\). Denoting \(X_G = (x_G, y_G)\) the barycenter of \(X_{i_{k}}: X_G=\sum _{k=1}^p\frac{X_{i_{k}}}{p}\), the inertia matrix of the cloud is defined by

$$\begin{aligned} \mathcal {E}=\frac{1}{p}\sum _{k=1}^p(X_{i_{k}}-X_G)(X_{i_{k}}-X_G)^T. \end{aligned}$$

Assuming that the \(X_{i_{k}}\) are not aligned, this matrix is symmetric and positive definite with strictly positive eigenvalues. Thanks to these values we can measure the angle \(\theta _2\) formed by the semi-major axis of the inertia ellipse and a reference direction, and the angle \(\theta _0\) formed by the line joining the origin to the barycenter of the lineage this a reference direction. The angle \(\theta _2\) is the angle which measures the direction of the eigenvector \(v_2\) associated to the larger eigenvalue \(\lambda _2\) . We then measure the quantity \(R_6=\theta _2-\theta _0-\frac{\pi }{2}\) where the shifting of \(\frac{\pi }{2}\) is done in order to have an angle always between \(-\frac{\pi }{2}\) and \(\frac{\pi }{2}\). In Fig. 4 is reported an example where the main direction of the ellipse (continuous line) representing the inertial matrix together with the ellipse (dotted line) is shown for three different lineages.

Fig. 4
figure 4

(Color figure online) Sketch of ellipses of inertia (not-to-scale) representing the inertia matrices for three different lineages (dotted lines). Major axes of inertia for the three different lineages (continuous line)

2.5 Experimental Protocol

In order to generate reference experimental data to which mathematical modeling can be confronted, we set up the following protocol. The experiments are performed on cells of the colon adenocarcinoma HCT116 cell line, modified by lentiviral transduction to express a histone \(H_2B\) fused with the mCherry fluorescent protein. This allows visualizing by fluorescence microscopy the nuclei of the cells. The cells are seeded in culture chambers (Lab-Tek, Dutscher) at a density of 7500 cells/cm\(^2\) in an OPTIMEM medium supplemented with 3% of fetal calf serum (FCS) and penicillin/streptomycin. After 48 h, the chosen cell density provides in the bottom of the chamber a culture of islets composed of about 50 cells, isolated from one another. This allows following the individual cell evolution in real time by an inverted fluorescence microscope. Before making microscopy acquisitions, isolated groups of cells are selected and the bottom of the culture chamber manually processed, to prevent neighboring cells to join the main group. Acquisitions are performed on an Axiovert microscope (Zeiss) fitted with a CoolSnap HQ camera (Roper Scientific) and piloted by the MetaView software. For every acquisition, several individual groups are followed in parallel by video-microscopy (1 image every 10 min). The images are processed using Metamorph and Image J before being analyzed.

The data post-processing consists of the following steps repeated for each single cell culture. Cells are selected at the initial time and the filiation tracked manually through direct labeling. Figure 1a, b shows an example of this procedure. Segmentation is first performed automatically thanks to the level of fluorescence, then checked and, if necessary, results are corrected by post-processing the data manually. This is possible thanks to the fact that the analysis is made on a relatively small number of cells. A segmentation result is shown in Fig. 5. A post-treatment is performed after the segmentation procedure. It consists of identifying each single lineage. The result is shown in Fig. 6 where the same experiment as in Figs. 1a, b and 5 is considered.

Fig. 5
figure 5

(Color figure online) Example of segmentation. Left initial tracking time, right final tracking time. The figure reports the nuclei of the cells. The black lines and the gray zones correspond to corrections done after the automatic segmentation procedure. Same experiment as in Fig. 1a, b

Fig. 6
figure 6

(Color figure online) Representation of the experimental data after segmentation. Left initial tracking time, right final tracking time. The same experiment as for Figs. 1a, b and 5 is considered. The pixels corresponding to nuclei are in white while the others are in black. The nuclei corresponding to a lineage which will be tracked are colored

We describe now how the experimental data are processed. The areas detected during segmentation correspond to the nuclei of the cells. For each of these areas, the coordinates of the center of mass and the equivalent circular diameter, i.e., the diameter of the disk that has the same surface as the area of interest, are computed. This permits to have a first representation of the data by disks (Fig. 7), similar to that used in the simulations. However, this gives large gaps between some disks and overlapping between others and it does not correspond to the observed experiments. Indeed, this is only an artifact of the representation because cells are stuck together and do not overlap. We then choose to represent the population by the same adapted Voronoï diagram as that used for the simulations. This result is reported in Fig. 8.

Fig. 7
figure 7

(Color figure online) Representation of cells by disks. Left initial tracking time, right final tracking time. The colored disks correspond to the cells whose lineage is tracked. The same experiment as for Figs. 1a, b and 5 is reported

Fig. 8
figure 8

(Color figure online) Representation of cells by the Voronoï diagram. Left initial tracking time, right final tracking time. The colored Voronoï regions correspond to the cells whose lineage is tracked. The same experiment as in Fig. 1a, b and 5 is reported

The lineages used for the comparisons with the simulations are either at the periphery of the aggregate or in the central region. A lineage is considered as peripheral if, at initial time, the progenitor cell is situated at the periphery of the aggregate, while it is considered as central if, at initial time, there are at least two cells between the progenitor cell and the boundary of the tumor. The data at our disposal are based on fourteen cellular cultures. This corresponds directly to the size of the samples which has been used in the first and the second diagnostic. In these fourteen experiments, we have followed twenty-two central and fifty-four peripheral lineages which corresponds to the size of samples used in diagnostics 4 and 6. The twenty-two central lineages split up into fifty-three connected components, while fifty-four peripheral lineages divided into one hundred and fifteen connected components which correspond to the size of samples for diagnostics 3 and 5.

3 Simulation Results and Comparisons with the Experimental Data

3.1 Identification of the Different Morphologies

Since we have chosen three possible orientation planes and two division strategies, for each of the six possible situations we perform 100 numerical simulations and we compute the values of the statistical indicators \(R_1\) up to \(R_6\). Concerning the study of the lineages, we extract two lineages, one in a central position and one on the boundaries of the cell population for which the different diagnostics are computed. This choice of the different position of the lineages is done in order to highlight the strong disparity between the behaviors of internal and external cells. This disparity which is one of the major results of this work is also confirmed by in vitro experiments as detailed next and not known before. The difference between the central and peripheral lineages is an information which is extrapolated from diagnostics \(R_3\) up to \(R_6\). In the appendix, we report the detailed results of the simulations. In this part, we summarize the principal results. (1) Presence of larger numbers of lineage fragments at the periphery, typically of smaller sizes. This can be explained by the fact that, as cells are farther from the center, their contribution to the total energy of the system grows. Thus, when they are pushed from the interior of the cellular aggregate because of the growth, they preferably move in tangential direction not to excessively increase the energy of the system. This result in an intercalation of new cells coming from the interior between originally neighboring cells. (2) Preferred tangential orientation of the lineages at the periphery. An interpretation of this phenomenon is that far from the center, the potential energy obliges cells to place themselves on an equipotential energy curve, i.e., along a single shell, all other equilibrium states being unstable. (3) In the central zone, except for the constrained radial division strategy, there are no privileged directions for the lineages. This suggests that in the central area, the division rule, when radial, plays a more important role than the positioning rule, this feature being opposite for the other division rules. (4) In general all strategies which leave freedom to the division plane orientation to change during division have a very small impact on the overall population shape as well as on the shape of a single lineage. On the contrary, the constrained strategy has much more influence on the shape of the entire population and of single lineages. (5) Concerning the global population, only the constrained strategy permits to detect differences between the radial and tangential directions of the division plane. The boundaries of the growing cell population are smoother for this second choice. (6) With the constrained radial orientation strategy for the division plane, the lineages in the center of the population are radially oriented with few fragments of large sizes.

3.2 Results of the Experiments

The same diagnostic analysis done for the mathematical model is performed on the experimental data. The results can be summarized as follows.

(1) Circularity of the lineages is very low compared to that of the entire population (the average value of \(R_1\in [0,1]\) is \(R_1=0.56\). (2) Lineages are filamentous (the average value of \(R_3\in [0,1]\) is very small, around 0.12). Central lineages are more filamentous than peripheral lineages: there is a larger number of lineages with \(R_3=0\) in the central part compared to the periphery. (3) There is a strong disparity (measured by \(R_4\)) between the central and the peripheral zones which is expressed by a stronger fragmentation of the central lineages compared to the peripheral ones. In the central zone, the number of lineages divided in one, two or three pieces is almost the same while on the periphery the number of lineages divided in two and in three parts is lower than the number of lineages which did not divide. (4) The central lineage fragments, measured by \(R_5\), are much smaller than those of the periphery. 2 / 3 of the fragments are composed of one or two cells in the center while on the periphery they are around \(40\%\). (5) Half of the central lineages have a direction very close to the radial one, while in the periphery no preferred orientation seems to arise (this value is measured by \(R_6\)).

Fig. 9
figure 9

(Color figure online) Comparison between the numerical simulations (the results of the different orientation strategies are averaged and reported on a single plot) and the experimental data. In red a lineage from the central zone and in black a lineage from the periphery. Left images show numerical results (a, c, e, g), right images report experimental data (b, d, f, h). ad Summarize the analysis of sphericity of the lineage (x-axis \(R_3\), y-axis frequency of the connected components with a given ratio area/perimeter). eh Summarize the analysis of the fragmentation of a lineage (x-axis \(R_4\), y-axis frequency of the number of connected components per lineage)

3.3 Comparisons with the Experimental Data

The comparisons between the simulation results and the experimental outcomes lead us to the following conclusions shown in Fig. 9. In this figure, the results for all the different orientation strategies used in the numerical simulation are summarized, i.e., the results of the different simulations are averaged and a cumulative distribution is reported. (1) Regarding the first two diagnostics, i.e., \(R_1\) and \(R_2\), which are not reported in the figure and which study the entire cell population, the experimental values are on average slightly lower than those obtained by the numerical simulations. In experiments cells organization is less regular. In particular boundaries are less smooth and the shapes are less round. This is likely due to the fact that real cells are less regular than the perfect disks chosen in the mathematical model. However, the results for these two diagnostics are qualitatively comparable and the choice of perfect disks does not seem to affect other results. (2) Both simulations and experiments highlight a difference between center and boundaries of the growing cell population. However, this disparity is expressed differently (indicator \(R_6\)): in the experiments, no preferred tangential orientation of the lineages appears at the periphery of the population (or more precisely only a slight preference for the tangential direction), while a clear preferred tangential orientation is obtained in the numerical simulations for all the different orientation strategies considered. On the other hand, a preferred radial orientation is visible for the central lineages in the experiments, which is very close to the results obtained when the constrained radial orientation strategy is used for the numerical simulations. (3) In the mathematical model, the peripheral lineages are more filamentous more fragmented into smaller fragments than the corresponding central lineages, while in the experiments the situation is reversed: peripheral lineages are less fragmented with larger size fragments than those in the center (from diagnostic \(R_4\) and \(R_5\)). Globally we can conclude that the initial choices done for constructing the mathematical model permit to reproduce some of the observed features, but they are not sufficient to correctly describe all the cells behaviors measured in the experiments. In particular, the difference observed at center of the aggregate between the data and simulations especially in diagnostic \(R_4\) (lineages fragmentation) suggests that some additional mechanism is responsible for the displacement of the central cells to the periphery. This mechanism disrupts the organization of the cells and makes central lineages more fragmented and filamentous. In the next section, we propose such mechanism and show that it results in simulations being closer to experimental data.

4 Improved Model: Bounded Confinement Force and Cell–Cell Interchange

Here, we propose additional mechanisms to reconcile the simulation results with the experimental data. The section is divided into three parts; in the first part, we discuss two improvements to the model. In the second part, we detail the modifications of the algorithm necessary to take into account these modifications. In the third part, we discuss comparisons between the new results and the experimental data.

4.1 Model Improvements

The first modification consists of the possibility for two adjacent cells to switch their positions. The second modification consists of modifying how the interaction potential depends on the distance from the center of the tumor. The first mechanism permits to switch the position between a new born cell and a neighboring cell. Indeed we hypothesize that compression by the other cell may induce deformations of the cell membrane and that the so deformed cell may be able to migrate into the extra-cellular medium. The random switch between two cells is a way to model this migration favored by cell deformation. We only allow newborn cells to shift their position with a neighboring cell because newborn cells have the smallest size and are more likely to find a migration path in the extra-cellular medium than mature cells. Finally, we only allow cells from the central region to perform this switch because cells from outer regions are subject to lower compression and weaker deformations which decreases their ability to migrate. We consider the possibility for a cell \(C_i\) to switch if its position is inside a disk defined by

$$\begin{aligned} d (0,X_i)\le C_\mathrm{int}\max _{0\le j\le N}(d (0,X_j)) \end{aligned}$$

with \( C_\mathrm{int}\in [0,1]\) a modeling parameter. The permutation rule is then as follows: after a division of a progenitor which lies inside this disk, one of the two daughter cells has the possibility to switch its position with one of its neighbors. The decision to switch is modeled by a probability following a Bernoulli distribution of parameter p: with probability p a newborn cell inside the sphere switches its position with a neighboring cell.

The second additional mechanism consists of applying a weaker attractive potential to the cells which are far from the center of the aggregate. With this aim, the quadratic potential is replaced by a linear potential when the tumor reaches a critical size and the linear potential applies only to cells which are farther than a critical distance. This reflects the hypothesis that cells are submitted to a lower mechanical compression at the periphery of the aggregate. However, for small-sized aggregates, we hypothesize that the adhesion forces between the cells are stronger (since a strong grouping enhances the survival chances of the cells) which motivates the use of a quadratic potential. The positioning rule is consequently modified as follows: as soon as the number of cells reaches a critical value \(N_\mathrm{C}\), a linear potential is used for the remote area while the same quadratic potential as defined in Sect. 2 is used for the other cells. The modified global adhesion potential is

$$\begin{aligned} W_L(\xi (t))=\sum _{j,|X_j(t)|\le R_c} |X_j(t)|^2+\sum _{j,|X_j(t)|\ge R_c} |X_j(t)|, \end{aligned}$$

where \(R_c=C_L \max _{0\le j\le N(t)}(d (0,X_j(t)))\) while the remote area is defined as the set containing the remote cells and consequently a cell at position X(t) is said remote if

$$\begin{aligned} d (0, X(t))\ge C_L \max _{0\le j\le N(t)}(d (0,X_j(t))) \end{aligned}$$

with \(C_L\in [0,1]\) a modeling parameter.

4.2 Algorithm Adaptation

The new structure of the numerical algorithm is the following

  1. (a)

    Initialization

  2. (b)

    At each time step

    1. (i)

      Growth step

    2. (ii)

      Test on size of the cell, cell by cell. If the threshold size is reached, a division occurs.

    3. (iii)

      For each mitosis up to the final division

      1. 1.

        Partial division.

      2. 2.

        Modified positioning step.

      3. 3.

        If necessary, depending on the orientation strategy chosen, orientation update.

    4. (iv)

      Permutation step.

    5. (v)

      Modified positioning step.

  3. (c)

    Statistical quantifiers computation.

We discuss the modified positioning step and the permutation step. The modified positioning step consists in finding a saddle point of the new Lagrangian function \(\mathcal L_L (\xi (t),\lambda (t)): (\mathbb {R}^2)^{N(t)}\times \mathbb {R}^M\rightarrow \mathbb {R}\) defined by

$$\begin{aligned} \mathcal L_L (\xi (t),\lambda (t))= & {} W_L(\xi (t))\\&+\sum _{1\le i\le j\le N(t)}\lambda _{ij}(t)\phi _{ij}(\xi (t),\rho (t)), \ \forall (\xi (t),\lambda (t)), \end{aligned}$$

Thus, starting from an initial guess \((\xi (t)^{(0)},\lambda (t)^{(0)})\), the method reads, as in the previous case, as

$$\begin{aligned} {\left\{ \begin{array}{ll} \xi ^{(p+1)} =X^{(p)}-\beta \nabla _x\mathcal L_L\left( \xi ^{(p)},\lambda ^{(p)}\right) , \\ \phi ^{(p+1)}_{ij} =\phi _{ij}\left( \xi ^{(p+1)}\right) , \quad \forall \ i,j\in [1,N], \ i<j, \\ \lambda ^{(p+1)}_{ij} = \max \left( 0,\lambda ^{(p)}_{ij}+\mu \phi ^{(p)}_{ij}\right) , \forall \ i,j\in [1,N], \ i<j,\\ \end{array}\right. } \end{aligned}$$

where \(\beta \) and \(\mu \) are the same numerical parameters as those discussed in Sect. 3. After some computations, the first equation of the above system can be rewritten for all cells in the remote region, i.e., \(|X_j|>R_c\), as

$$\begin{aligned} X^{(p+1)}_k =\left( 1-\frac{\beta }{|X_k^{(p)}|}\right) X_k^{(p)}+2\beta \sum _{j=1}^{N}\lambda ^{(p)}_{kj}\left( X_k^{(p)}-X_j^{(p)}\right) . \end{aligned}$$

The same stopping criteria are used for this new positioning algorithm. During the research for a saddle point, it may happen that a cell close to the boundary between the central and the remote regions changes zone. Since this displacement is typically very small, we choose not to change the potential energy to which this cell is submitted during the minimization procedure.

The permutation algorithm consists simply in choosing with probability p if a newborn cell performs a switch. In order to do that, denoting by \(C_{I}\) the cell which has decided to perform a switch, we first determine all the neighboring cells of \(C_{I}\) and then we pick randomly one of them with uniform distribution and we perform the switch. The values of the new parameters added to the model are summarized in Table 3. The value of \(C_L\) is chosen so that the central region coincides with the definition of a central lineage in the experiments.

Table 3 Numerical parameters for the modified algorithm
Fig. 10
figure 10

(Color figure online) Diagnostic \(R_4\): fragmentation of a lineage in the central region with cell switch mechanism for different values of the switching probability p. Left \(p=0.1\), middle \(p=0.15\), right \(p=0.2\). The more p increases, the more the distribution shifts to the right: the lineages are separated into a larger number of fragments

4.3 Comparisons Between the Experiments and the Improved Numerical Model

We first analyze separately the impacts of the two modifications introduced in the model. We start discussing the effect of the switch. The results for diagnostic \(R_4\) (lineage fragmentation) and \(R_5\) (size of the fragments of a lineage) are reported, respectively, in Fig. 10 and 11 for three different values of the permutation probability p: \(p=0.1, \ p=0.15, \ p=0.2\). They show that the larger the switching probability, the more fragmented the lineages are and the smaller the fragments are. Cell switching even though it is performed only in the central region has also an influence on the peripheral region. However, the impact of these changes is low and we do not report it. The direction of lineages computed with diagnostic \(R_6\) does not change noticeably with the switching.

Fig. 11
figure 11

(Color figure online) Diagnostic \(R_5\): number of cells per connected component of a given lineage in the central region with cell switching mechanism for different values of the probability p. Left \(p=0.1\), middle \(p=0.15\), right \(p=0.2\). The more p increases, the more the values are concentrated on the left of the distribution: the number of small connected components increases. A piecewise linear interpolation of the cumulative distribution is depicted in blue color. The values of this piecewise linear interpolation are indicated in the graph

Fig. 12
figure 12

(Color figure online) Diagnostic \(R_4\): fragmentation of a lineage with the modified potential at the periphery for different values of the threshold number \(N_s\) which performs the switch from the quadratic potential to the modified one. Left \(N_s=100\), right \(N_s=200\)

Fig. 13
figure 13

(Color figure online) Diagnostic \(R_5\): number of cells per connected component of a given lineage with the modified potential law at the periphery for different values of the threshold number \(N_s\) which performs the switch from the quadratic potential to the modified one. Left \(N_s=100\), right \(N_s=200\). A piecewise linear interpolation of the cumulative distribution is depicted in blue color. The values of this piecewise linear interpolation are indicated in the graph

Fig. 14
figure 14

(Color figure online) Comparison between the numerical simulations and the experimental data. In red a lineage from the central zone and in black a lineage from the peripheral zone. Left images report original numerical results (a, d, g, j), center images report experimental data (b, e, h, k), right images report numerical results with the modified model (c, f, i, l). Top and middle top, fragmentation of a lineage (x-axis \(R_4\), y-axis frequency of the number of connected components per lineage). Middle bottom and bottom, number of cells per connected component (x-axis \(R_5\), y-axis connected component cumulative frequency)

Now, we consider the influence of the change in the attractive potential. The results for diagnostics \(R_4\) and \(R_5\) for two different values of the parameter \(N_s\), i.e., \(N_s=100\) and \(N_s=200\) are reported in Figs. 12 and 13. They show the effect of this additional mechanism at the periphery of the tumor. In particular, we observe that the smaller \(N_s\) is, the less segmented the lineages are and the bigger the fragments are at the periphery. The change in the potential energy has also an effect in the central zone, where the lineages are becoming less fragmented. Finally, regarding the direction of the lineages with diagnostic \(R_6\), we do not observe noticeable compared to the quadratic potential.

We finally observe the results obtained while combining the two modifications. As shown in Fig. 14, the simulated results obtained with the two model improvements are more similar to experimental results, both in the central zone and at the periphery. In the figure, the results of the Diagnostics 4 and 5 are reported. For these tests a switching probability for a daughter cell of \(p=0.2\) and a threshold of \(N=200\) to pass from a quadratic to a linear potential have been chosen. These parameters permit the best fit between the simulations and the data. We conclude that these modifications improve the match between the model and the experiments. The distributions of fragments number and size of lineages obtained with the modified model match those of the experimental data remarkably well.

5 Conclusions

This work represents a step toward understanding the impact of division parameters on the growth of a cell population via comparison of mathematical models and experiments. The approach consists of a bottom-up strategy where the behavior of a growing population of cells and the structure of the associated lineages are modeled through simple interaction rules of mechanical type between cells. After observing that these simple rules could not explain the morphology of the cell population alone, we introduced additional phenomena, which, at first were considered negligible. This process of gradually increasing complexity was repeated until a good fit between experiments and simulations is obtained. This approach permits to assess which key mechanisms are more likely to be underlying the observed phenomena without introducing too many empirical parameters. From the mathematical point of view, the energy minimization considered here is motivated by the observation that physical principles are often expressed in variational forms. Our results suggest that this variational approach seems also at play here. Our numerical and experimental results show a wide disparity between central and peripheral lineages. Peripheral lineages are more fragmented and slightly tangentially oriented. With the simplest model, some differences between simulations and experimental data are found: experiments show that cells in the central region move over larger distances than in the model. We thus introduced the possibility for cells to switch positions inside the cell population. We also lowered the aggregation force at the periphery of the cellular aggregate to model weaker aggregation of peripheral cells. The corresponding numerical results match the experimental data very convincingly. Another interesting experimental observation is that in the central area, a preferred radial direction of the lineages emerges and that a similar feature can be found in the model if a radial division plane orientation is imposed. The analysis suggests that the disparity between the center and the periphery, found experimentally and verified numerically, could be explained by the simple hypotheses made in the model. More quantitative work is needed to understand the role of the division orientation on the observed emerging structures and on lineage shape and orientation. In the future, larger populations should be considered. On the other hand, considering very small populations permits to ignore the role played by nutrients, growth factors and oxygen, and to consider simple two-dimensional settings for both the model and the experiments. This also made the image processing easier and more reliable avoiding problems related to the tracking of cells in a three-dimensional structure and it allowed for the use of CPU-effective agent-based model which would be too costly in three dimensions. However, these simplifying choices lead to a model with restricted validity and questionable applicability to three-dimensional structures. In the experimental setting considered, cells move on a plane. Thus, our two-dimensional model is a valid representation of the biological situation. However, we may expect the results to be different in a fully three-dimensional experiment and not well accounted for by a two-dimensional model. In particular, we may expect that the differences between the internal and the peripheral lineages that we observe in the two-dimensional case will be even stronger in the three-dimensional situation as the scale ratio between the surface of the periphery of the spheroid to its internal part will change. To understand the role of the orientation of the division plane, future experiments which track cells during mitosis would permit to further explore the biology of tumor aggregates and provide a better benchmark for the validation of three-dimensional models. Another direction of research is to explore the impact of mechanical confinement on cell proliferation. Recent experiments (Desmaison et al. 2013b) showed that proliferation gradients within mechanically confined spheroids are different from those in spheroids grown in suspension. This discovery strengthens the hypothesis of mechanical forces playing a central role in the morphologies of the lineages and requires further studies.