ترغب بنشر مسار تعليمي؟ اضغط هنا

Extreme values for characteristic radii of a Poisson-Voronoi tessellation

199   0   0.0 ( 0 )
 نشر من قبل Pierre Calka
 تاريخ النشر 2013
  مجال البحث
والبحث باللغة English
 تأليف Pierre Calka




اسأل ChatGPT حول البحث

A homogeneous Poisson-Voronoi tessellation of intensity $gamma$ is observed in a convex body $W$. We associate to each cell of the tessellation two characteristic radii: the inradius, i.e. the radius of the largest ball centered at the nucleus and included in the cell, and the circumscribed radius, i.e. the radius of the smallest ball centered at the nucleus and containing the cell. We investigate the maximum and minimum of these two radii over all cells with nucleus in $W$. We prove that when $gammarightarrowinfty$, these four quantities converge to Gumbel or Weibull distributions up to a rescaling. Moreover, the contribution of boundary cells is shown to be negligible. Such approach is motivated by the analysis of the global regularity of the tessellation. In particular, consequences of our study include the convergence to the simplex shape of the cell with smallest circumscribed radius and an upper-bound for the Hausdorff distance between $W$ and its so-called Poisson-Voronoi approximation.



قيم البحث

اقرأ أيضاً

The typical cell of a Voronoi tessellation generated by $n+1$ uniformly distributed random points on the $d$-dimensional unit sphere $mathbb S^d$ is studied. Its $f$-vector is identified in distribution with the $f$-vector of a beta polytope generate d by $n$ random points in $mathbb R^d$. Explicit formulae for the expected $f$-vector are provided for any $d$ and the low-dimensional cases $din{2,3,4}$ are studied separately. This implies an explicit formula for the total number of $k$-dimensional faces in the spherical Voronoi tessellation as well.
Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the directional dist ribution, the quantity $n^{frac{2}{d-1}}sqrt[n]{mathbb{P}(f(Z)=n)}$ is bounded from above and from below. When $f(Z)$ is large, the isoperimetric ratio of $Z$ is bounded away from zero with high probability. These results rely on one hand on the Complementary Theorem which provides a precise decomposition of the distribution of $Z$ and on the other hand on several geometric estimates related to the approximation of polytopes by polytopes with fewer facets. From the asymptotics of the distribution of $f(Z)$, tail estimates for the so-called $Phi$ content of $Z$ are derived as well as results on the conditional distribution of $Z$ when its $Phi$ content is large.
In this paper, we consider a Riemannian manifold $M$ and the Poisson-Voronoi tessellation generated by the union of a fixed point $x_0$ and a Poisson point process of intensity $lambda$ on $M$. We obtain asymptotic expansions up to the second order f or the means of several characteristics of the Voronoi cell associated with $x_0$, including its volume and number of vertices. In each case, the first term of the estimate is equal to the mean characteristic in the Euclidean setting while the second term may contain a particular curvature of $M$ at $x_0$: the scalar curvature in the case of the mean number of vertices, the Ricci curvature in the case of the density of vertices and the sectional curvatures in the cases of the volume and number of vertices of a section of the Voronoi cell. Several explicit formulas are also derived in the particular case of constant curvature. The key tool for proving these results is a new change of variables formula of Blaschke-Petkantschin type in the Riemannian setting. Finally, a probabilistic proof of the Gauss-Bonnet Theorem is deduced from the asymptotic estimate of the total number of vertices of the tessellation in dimension two.
We present a new open source code for massive parallel computation of Voronoi tessellations(VT hereafter) in large data sets. The code is focused for astrophysical purposes where VT densities and neighbors are widely used. There are several serial Vo ronoi tessellation codes, however no open source and parallel implementations are available to handle the large number of particles/galaxies in current N-body simulations and sky surveys. Parallelization is implemented under MPI and VT using Qhull library. Domain decomposition takes into account consistent boundary computation between tasks, and includes periodic conditions. In addition, the code computes neighbors list, Voronoi density, Voronoi cell volume, density gradient for each particle, and densities on a regular grid.
135 - Pierre Calka 2012
In this paper, we construct a new family of random series defined on $R^D$, indexed by one scaling parameter and two Hurst-like exponents. The model is close to Takagi-Knopp functions, save for the fact that the underlying partitions of $R^D$ are not the usual dyadic meshes but random Voronoi tessellations generated by Poisson point processes. This approach leads us to a continuous function whose random graph is shown to be fractal with explicit and equal box and Hausdorff dimensions. The proof of this main result is based on several new distributional properties of the Poisson-Voronoi tessellation on the one hand, an estimate of the oscillations of the function coupled with an application of a Frostman-type lemma on the other hand. Finally, we introduce two related models and provide in particular a box-dimension calculation for a derived deterministic Takagi-Knopp series with hexagonal bases.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا