A global construction of homogeneous random planar tessellations that are stable under iteration

Homogeneous (i.e. spatially stationary) random tessellations of the Euclidean plane are constructed which have the characteristic property to be stable under the operation of iteration (or nesting), STIT for short. It is based on a Poisson point process on the space of lines that are endowed with a time of birth. A new approach is presented that describes the tessellation in the whole plane. So far, an explicit geometrical construction for those tessellations was only known within bounded windows.     

Shape-driven nested Markov tessellations

A new and rather broad class of stationary random tessellations of the d-dimensional Euclidean space is introduced, which we call shape-driven nested Markov tessellations. Locally, these tessellations are constructed by means of a spatio-temporal random recursive split dynamics governed by a family of Markovian split kernel, generalizing thereby the – by now classical – construction of iteration stable random tessellations. By providing an explicit global construction of the tessellations, it is shown that under suitable assumptions on the split kernels (shape-driven), there exists a unique time-consistent whole-space tessellation-valued Markov process of stationary random tessellations compatible with the given split kernels. Beside the existence and uniqueness result, the typical cell and some aspects of the first-order geometry of these tessellations are in the focus of our discussion.     

Bernoulli Cluster Field: Voronoi Tessellations

A new point process is proposed which can be viewed either as a Boolean cluster model with two cluster modes or as a p-thinned Neyman-Scott cluster process with the retention of the original parent point. Voronoi tessellation generated by such a point process has extremely high coefficients of variation of cell volumes as well as of profile areas and lengths in the planar and line induced tessellations. An approximate numerical model of tessellation characteristics is developed for the case of small cluster size; its predictions are compared with the results of computer simulations. Tessellations of this type can be used as models of grain structures in steels.     

Asymptotic shape of small cells

A stationary Poisson line tessellation is considered whose directional distribution is concentrated on two different atoms with some positive weights. The shape of the typical cell of such a tessellation is studied when its area or its perimeter tends to zero. In contrast to known results where the area or the perimeter tends to infinity, it is shown that the asymptotic shape of cells having small area is degenerate. Again in contrast to the case of large cells, the asymptotic shape of cells with small perimeter is not uniquely determined. The results are accompanied by a large scale simulation study.     

Poisson polyhedra in high dimensions

The zero cell of a parametric class of random hyperplane tessellations depending on a distance exponent and an intensity parameter is investigated, as the space dimension tends to infinity. The model includes the zero cell of stationary and isotropic Poisson hyperplane tessellations as well as the typical cell of a stationary Poisson Voronoi tessellation as special cases. It is shown that asymptotically in the space dimension, with overwhelming probability these cells satisfy the hyperplane conjecture, if the distance exponent and the intensity parameter are suitably chosen dimension-dependent functions. Also the high dimensional limits of the mean number of faces are explored and the asymptotic behaviour of an isoperimetric ratio is analysed. In the background are new identities linking the f-vector of the zero cell to certain dual intrinsic volumes.     

Simulation of typical Cox–Voronoi cells with a special regard to implementation tests

We consider stationary Poisson line processes in the Euclidean plane and analyze properties of Voronoi tessellations induced by Poisson point processes on these lines. In particular, we describe and test an algorithm for the simulation of typical cells of this class of Cox–Voronoi tessellations. Using random testing, we validate our algorithm by comparing theoretical values of functionals of the zero cell to simulated values obtained by our algorithm. Finally, we analyze geometric properties of the typical Cox–Voronoi cell and compare them to properties of the typical cell of other well-known classes of tessellations, especially Poisson–Voronoi tessellations. Our results can be applied to stochastic–geometric modelling of networks in telecommunication and life sciences, for example. The lines can then represent roads in urban road systems, blood arteries or filament structures in biological tissues or cells, while the points can be locations of telecommunication equipment or vesicles, respectively.     

The Combinatorial Structure of Spatial STIT Tessellations

Spatially homogeneous random tessellations that are stable under iteration (nesting) in the $3$ 3 -dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a space-time process of subsequent cell division and, consequently, they are not facet-to-facet. The intent of this paper is to develop a detailed analysis of the combinatorial structure of such tessellations and to determine a number of new geometric mean values, for example for the neighbourhood of the typical vertex. The heart of the results is a fine classification of tessellation edges based on the type of their endpoints or on the equality relationship with other types of line segments. In the background of the proofs are delicate distributional properties of spatial STIT tessellations.     

Exploratory data analysis for planar tessellations: Structural analysis and point process methods

This paper presents methods for the exploratory analysis of particular geometrical data, namely planar tessellations. At first, two non-stochastic methods are suggested which may help to classify tessellations and to understand their structure. The first one consists of approximating a given tessellation by a Dirichlet tessellation. The other one uses the nodes of a given tessellation and tests the possibility of reconstructing it by a fixed rule of connecting nodes by edges. Furthermore, in order to obtain information on the spatial behaviour of a tessellation, we suggest the use of the methods of point process statistics. In particular, pair correlation and mark correlation functions describe spatial correlations in tessellations.     

Model Based Estimation of Geometric Characteristics of Open Foams

Open cell foams are a class of modern materials which is interesting for a wide variety of applications and which is not accessible to classical materialography based on 2d images. 3d imaging by micro computed tomography is a practicable alternative. Analysis of the resulting volume images is either based on a simple binarisation of the image or on so-called cell reconstruction by image processing. The first approach allows to estimate mean characteristics like the mean cell volume using the typical cell of a random spatial tessellation as model for the cell shape. The cell reconstruction allows estimation of empirical distributions of cell characteristics. This paper summarises the theoretical background for the first method, in particular estimation of the intrinsic volumes and their densities from discretized data and models for random spatial tessellations. The accuracy of the estimation method is assessed using the dilated edge systems of simulated random spatial tessellations.     

Small faces in stationary Poisson hyperplane tessellations

We consider the tessellation induced by a stationary Poisson hyperplane process in d‐dimensional Euclidean space. Under a suitable assumption on the directional distribution, and measuring the k‐faces of the tessellation by a suitable size functional, we determine a limit distribution for the shape of the typical k‐face, under the condition of given size and this tending to zero. The limit distribution is concentrated on simplices. This extends a result of Gilles Bonnet.     

Second‐order properties of the point process of nodes in a stationary Voronoi tessellation

In this paper we derive representation formulae for the second factorial moment measure of the point process of nodes and the second moment of the number of vertices of the typical cell associated with a stationary normal Voronoi tessellation in ?^d . In case the Voronoi tessellation is generated by a stationary Poisson process with intensity λ > 0 the corresponding pair correlation function g_V,λ (r) can be expressed by a weighted sum of d +2 (numerically tractable) multiple parameter integrals. The asymptotic variance of the number of nodes in an increasing cubic domain as well as the second moment of the number of vertices of the typical Poisson Voronoi cell are calculated exactly by means of these parameter integrals. The existence of a (d ? 1)st‐order pole of g_V,λ (r) at r = 0 is proved and the exact value of lim_{r →0} r^{d –1} g_V,λ (r) is determined. In the particular cases d = 2 and d = 3 the graph of g_V,1(r) including its local extreme points, the points of level 1 of gV, 1(r) and other characteristics are computed by numerical integration. Furthermore, an asymptotically exact confidence interval for the intensity of nodes is obtained. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Conditional length distributions induced by the coverage of two points by a Poisson Voronoï tessellation: application to a telecommunication model

The end points of a fixed segment in the Euclidian plane covered by a Poisson Voronoï tessellation belong to the same cell or to two distinct cells. This marks off one or two points of the underlying Poisson process that are the nucleus(i) of the cell(s). Our interest lies in the geometrical relationship between these nuclei and the segment end points as well as between the nuclei. We investigate their probability distribution functions conditioning on the number of nuclei, taking into account the length of the segment. The aim of the study is to establish some tools to be used for the analysis of a telecommunication problem related to the pricing of leased lines. We motivate and give accurate approximations of the probability of common coverage and of the length distributions that can be included in spreadsheet codes as an element of simple cost functions. Copyright © 2006 John Wiley & Sons, Ltd.     

How many T‐tessellations on k lines? Existence of associated Gibbs measures on bounded convex domains

The paper bounds the number of tessellations with T‐shaped vertices on a fixed set of k lines: tessellations are efficiently encoded, and algorithms retrieve them, proving injectivity. This yields existence of a completely random T‐tessellation, as defined by Kiêu et al. (Spat Stat 6 (2013) 118–138), and of its Gibbsian modifications. The combinatorial bound is sharp, but likely pessimistic in typical cases. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 561–587, 2015     

Large Cells in Poisson–Delaunay Tessellations

It is proved that the shape of the typical cell of a Delaunay tessellation, derived from a stationary Poisson point process in d-dimensional Euclidean space, tends to the shape of a regular simplex, given that the volume of the typical cell tends to infinity. This follows from an estimate for the probability that the typical cell deviates by a given amount from regularity, given that its volume is large. As a tool for the proof, a stability result for simplices is established.     

Elliptic operators on planar graphs: Unique continuation for eigenfunctions and nonpositive curvature

This paper is concerned with elliptic operators on plane tessellations. We show that such an operator does not admit a compactly supported eigenfunction if the combinatorial curvature of the tessellation is nonpositive. Furthermore, we show that the only geometrically finite, repetitive plane tessellations with nonpositive curvature are the regular and tilings.

     

Typical Cells in Poisson Hyperplane Tessellations

It is proved that the shape of the typical cell of a stationary and isotropic Poisson random hyperplane tessellation is, with high probability, close to the shape of a ball if the kth intrinsic volume (k ≥ 2) of the typical cell is large. The shape of typical cells of large diameter is close to the shape of a segment.     

The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2

We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster tends to 1/2 as the intensity of the Poisson process tends to infinity. This confirms a conjecture of Benjamini and Schramm [5].     

Faces of Poisson�CVoronoi mosaics

For a stationary Poisson?CVoronoi tessellation in Euclidean d-space and for ${k\in \{1,\dots,d\}}$ , we consider the typical k-dimensional face with respect to a natural centre function. We express the distribution of this typical k-face in terms of a certain Poisson process of closed halfspaces in a k-dimensional space. Then we show that, under the condition of large inradius, the relative boundary of the typical k-face lies, with high probability, in a narrow spherical annulus.     

2D Centroidal Voronoi Tessellations with Constraints

<正>We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation.We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the constrained Delaunay edges.The clipping itself is efficiently computed by identifying for each constrained edge the(connected) set of triangles whose dual Voronoi vertices are hidden by the constraint.The resulting construction is amenable to Lloyd relaxation so as to obtain a centroidal tessellation with constraints.     

Singularity among selfsimilar Gaussian random fields with different scaling parameters and others

Abstract

It is shown in this paper that the probability measures generated by selfsimilar Gaussian random fields are mutually singular, whenever they have different scaling parameters. So are those generated from a selfsimilar Gaussian random field and a stationary Gaussian random field. Certain conditions are also given for the singularity of the probability measures generated from two Gaussian random fields whose covariance functions are Schoenberg–Lévy kernels, and for those from stationary Gaussian random fields with spectral densities.