相关论文: On non-Poissonian Voronoi tessellations
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…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
The voids between galaxies are identified with the volumes of the Poisson Voronoi tessellation. Two new survival functions for the apparent radii of voids are derived. The sectional normalized area of the Poisson Voronoi tessellation is…
By a new Monte Carlo algorithm we evaluate the sidedness probability p_n of a planar Poisson-Voronoi cell in the range 3 \leq n \leq 1600. The algorithm is developed on the basis of earlier theoretical work; it exploits, in particular, the…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
Let $S$ be a set of $n$ points in general position in $\mathbb{R}^d$. The order-$k$ Voronoi diagram of $S$, $V_k(S)$, is a subdivision of $\mathbb{R}^d$ into cells whose points have the same $k$ nearest points of $S$. Sibson, in his seminal…
As in the case of soliton PDEs in 2+1 dimensions, the evolutionary form of integrable dispersionless multidimensional PDEs is non-local, and the proper choice of integration constants should be the one dictated by the associated Inverse…
For sequences of Poisson-Laguerre tessellations and their duals in $\mathbb{R}^d$, generated by Poisson point processes $(\eta_n)_{n\in\mathbb{N}}$ in $\mathbb{R}^d \times \mathbb{R}$, we prove limit theorems as $n\to \infty$. The intensity…
In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellations, not only the locations of the Voronoi generators, but…
The application of Voronoi and Delaunay tessellation based methods for reconstructing continuous fields from discretely sampled data sets is discussed. The succesfull operation as ``multidimensional interpolation'' method is corroborated…
We consider the typical cell of a stationary Poisson hyperplane tessellation in d-dimensional Euclidean space. It is well known that the expected vertex number of the typical cell is independent of the directional distribution of the…
Clustering is an important phenomenon in turbulent flows laden with inertial particles. Although this process has been studied extensively, there are still open questions about both the fundamental physics and the reconciliation of…
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of…
Voronoi intensity estimators, which are non-parametric estimators for intensity functions of point processes, are both parameter-free and adaptive; the intensity estimate at a given location is given by the reciprocal size of the…
We present a new particle-merging algorithm for the particle-in-cell method. Based on the concept of the Voronoi diagram, the algorithm partitions the phase space into smaller subsets, which consist of only particles that are in close…
While the standard unweighted Voronoi diagram in the plane has linear worst-case complexity, many of its natural generalizations do not. This paper considers two such previously studied generalizations, namely multiplicative and semi…
Recently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square…
We dynamically simulate fractionation (partitioning of particle species) during spinodal gas-liquid separation of a size-polydisperse colloid, using polydispersity up to ~40% and a skewed parent size distribution. We introduce a novel…
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…
Motivated by the fundamental problem of modeling the frequency of frequencies (FoF) distribution, this paper introduces the concept of a cluster structure to define a probability function that governs the joint distribution of a random…