53 research outputs found
Convex Dynamics and Applications
This paper proves a theorem about bounding orbits of a time dependent
dynamical system. The maps that are involved are examples in convex dynamics,
by which we mean the dynamics of piecewise isometries where the pieces are
convex. The theorem came to the attention of the authors in connection with the
problem of digital halftoning. \textit{Digital halftoning} is a family of
printing technologies for getting full color images from only a few different
colors deposited at dots all of the same size. The simplest version consist in
obtaining grey scale images from only black and white dots. A corollary of the
theorem is that for \textit{error diffusion}, one of the methods of digital
halftoning, averages of colors of the printed dots converge to averages of the
colors taken from the same dots of the actual images. Digital printing is a
special case of a much wider class of scheduling problems to which the theorem
applies. Convex dynamics has roots in classical areas of mathematics such as
symbolic dynamics, Diophantine approximation, and the theory of uniform
distributions.Comment: LaTex with 9 PostScript figure
Combinatorial Convexity and Algebraic Geometry
[no abstract available
Implementing vertex dynamics models of cell populations in biology within a consistent computational framework
The dynamic behaviour of epithelial cell sheets plays a central role during development, growth, disease and wound healing. These processes occur as a result of cell adhesion, migration, division, differentiation and death, and involve multiple processes acting at the cellular and molecular level. Computational models offer a useful means by which to investigate and test hypotheses about these processes, and have played a key role in the study of cell–cell interactions. However, the necessarily complex nature of such models means that it is difficult to make accurate comparison between different models, since it is often impossible to distinguish between differences in behaviour that are due to the underlying model assumptions, and those due to differences in the in silico implementation of the model. In this work, an approach is described for the implementation of vertex dynamics models, a discrete approach that represents each cell by a polygon (or polyhedron) whose vertices may move in response to forces. The implementation is undertaken in a consistent manner within a single open source computational framework, Chaste, which comprises fully tested, industrial-grade software that has been developed using an agile approach. This framework allows one to easily change assumptions regarding force generation and cell rearrangement processes within these models. The versatility and generality of this framework is illustrated using a number of biological examples. In each case we provide full details of all technical aspects of our model implementations, and in some cases provide extensions to make the models more generally applicable
- …