Related papers: Rectangular Gilbert Tessellation
A Gilbert tessellation arises by letting linear segments (cracks) in the plane unfold in time with constant speed, starting from a homogeneous Poisson point process of germs in randomly chosen directions. Whenever a growing edge hits an…
We investigate the ray-length distributions for two different rectangular versions of Gilbert's tessellation. In the full rectangular version, lines extend either horizontally (with east- and west-growing rays) or vertically (north- and…
In the full rectangular version of Gilbert's tessellation lines extend either horizontally (with east- and west--growing rays) or vertically (north- and south--growing rays) from seed points which form a Poisson point process, each ray…
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
Processes of random tessellations of the Euclidean space $\mathbb{R}^d$, $d\geq 1$, are considered which are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
In this paper, we consider a regular tessellation of the Euclidean plane and the sequence of its geometric scalings by negative powers of a fixed integer. We generate iteratively random sets as the union of adjacent tiles from these…
Stationary Poisson processes of lines in the plane are studied whose directional distributions are concentrated on $k \ge 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random…
We propose an iterated version of the Gilbert model, which results in a sequence of random mosaics of the plane. We prove that under appropriate scaling, this sequence of mosaics converges to that obtained by a classical Poisson line…
We consider a growing planar network where a tip grows at constant speed, branches at constant rate and inactivates when it meets a branch already created. We only consider here orthogonal branching occurring always in the same direction.…
In their 1993 paper, Arak, Clifford and Surgailis discussed a new model of random planar graph. As a particular case, that model yields tessellations with only T-vertices (T-tessellations). Using a similar approach involving Poisson lines,…
With any max-stable random process $\eta$ on $\mathcal{X}=\mathbb{Z}^d$ or $\mathbb{R}^d$, we associate a random tessellation of the parameter space $\mathcal{X}$. The construction relies on the Poisson point process representation of the…
Three-dimensional random tessellations that are stable under iteration (STIT tessellations) are considered. They arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the…
This paper deals with the typical cell in a Poisson line tessellation in the plane whose directional distribution is concentrated on three equally spread values with possibly different weights. Such a random polygon can only be a triangle,…
A branching random tessellation (BRT) is a stochastic process that transforms a coarse initial tessellation of $\mathbb{R}^d$ into a finer tessellation by means of random cell divisions in continuous time. This concept generalises the…
A Poisson line tessellation is observed within a window. With each cell of the tessellation, we associate the inradius, which is the radius of the largest ball contained in the cell. Using Poisson approximation, we compute the limit…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
We study the problem of generating a hyperplane tessellation of an arbitrary set $T$ in $\mathbb{R}^n$, ensuring that the Euclidean distance between any two points corresponds to the fraction of hyperplanes separating them up to a…
We consider a family of random line tessellations of the Euclidean plane introduced in a much more formal context by Hug and Schneider [Geom. Funct. Anal. 17, 156 (2007)] and described by a parameter \alpha\geq 1. For \alpha=1 the zero-cell…
Poisson point processes provide a versatile framework for modeling the distributions of random points in space. When the space is partitioned into cells, each associated with a single generating point from the Poisson process, there appears…