Large faces in Poisson hyperplane mosaics

A generalized version of a well-known problem of D. G. Kendall states that the zero cell of a stationary Poisson hyperplane tessellation in ${\mathbb{R}}^d$, under the condition that it has large volume, approximates with high probability a certain definite shape, which is determined by the directional distribution of the underlying hyperplane process. This result is extended here to typical $k$-faces of the tessellation, for $k\in\{2,...,d-1\}$. This requires the additional condition that the direction of the face be in a sufficiently small neighbourhood of a given direction.Comment: Published in at http://dx.doi.org/10.1214/09-AOP510 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

Structural characterization and statistical-mechanical model of epidermal patterns

In proliferating epithelia of mammalian skin, cells of irregular polygonal-like shapes pack into complex nearly flat two-dimensional structures that are pliable to deformations. In this work, we employ various sensitive correlation functions to quantitatively characterize structural features of evolving packings of epithelial cells across length scales in mouse skin. We find that the pair statistics in direct and Fourier spaces of the cell centroids in the early stages of embryonic development show structural directional dependence, while in the late stages the patterns tend towards statistically isotropic states. We construct a minimalist four-component statistical-mechanical model involving effective isotropic pair interactions consisting of hard-core repulsion and extra short-ranged soft-core repulsion beyond the hard core, whose length scale is roughly the same as the hard core. The model parameters are optimized to match the sample pair statistics in both direct and Fourier spaces. By doing this, the parameters are biologically constrained. Our model predicts essentially the same polygonal shape distribution and size disparity of cells found in experiments as measured by Voronoi statistics. Moreover, our simulated equilibrium liquid-like configurations are able to match other nontrivial unconstrained statistics, which is a testament to the power and novelty of the model. We discuss ways in which our model might be extended so as to better understand morphogenesis (in particular the emergence of planar cell polarity), wound-healing, and disease progression processes in skin, and how it could be applied to the design of synthetic tissues

IST Austria Thesis

In this thesis we study persistence of multi-covers of Euclidean balls and the geometric structures underlying their computation, in particular Delaunay mosaics and Voronoi tessellations. The k-fold cover for some discrete input point set consists of the space where at least k balls of radius r around the input points overlap. Persistence is a notion that captures, in some sense, the topology of the shape underlying the input. While persistence is usually computed for the union of balls, the k-fold cover is of interest as it captures local density, and thus might approximate the shape of the input better if the input data is noisy. To compute persistence of these k-fold covers, we need a discretization that is provided by higher-order Delaunay mosaics. We present and implement a simple and efficient algorithm for the computation of higher-order Delaunay mosaics, and use it to give experimental results for their combinatorial properties. The algorithm makes use of a new geometric structure, the rhomboid tiling. It contains the higher-order Delaunay mosaics as slices, and by introducing a filtration function on the tiling, we also obtain higher-order α-shapes as slices. These allow us to compute persistence of the multi-covers for varying radius r; the computation for varying k is less straight-foward and involves the rhomboid tiling directly. We apply our algorithms to experimental sphere packings to shed light on their structural properties. Finally, inspired by periodic structures in packings and materials, we propose and implement an algorithm for periodic Delaunay triangulations to be integrated into the Computational Geometry Algorithms Library (CGAL), and discuss the implications on persistence for periodic data sets