Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T20:19:04.631Z Has data issue: false hasContentIssue false

Approximate decomposition of some modulated-Poisson Voronoi tessellations

Published online by Cambridge University Press:  01 July 2016

Bartłomiej Błaszczyszyn*
Affiliation:
ENS/INRIA, Paris, and University of Wrocław
René Schott*
Affiliation:
Université Henri Poincaré-Nancy 1
*
∗ Postal address: ENS, 45 rue d'Ulm, 75230 Paris, France. Email address: bartek.blaszczyszyn@ens.fr
∗∗ Postal address: Université Henri Poincaré-Nancy 1, BP 239, 54506 Vandoeuvre-lès-Nancy, France.

Abstract

We consider the Voronoi tessellation of Euclidean space that is generated by an inhomogeneous Poisson point process whose intensity takes different constant values on sets of some finite partition of the space. Considering the Voronoi cells as marks associated with points of the point process, we prove that the intensity measure (mean measure) of the marked Poisson point process admits an approximate decomposition formula. The true value is approximated by a mixture of respective intensity measures for homogeneous models, while the explicit upper bound for the remainder term can be computed numerically for a large class of practical examples. By the Campbell formula, analogous approximate decompositions are deduced for the Palm distributions of individual cells. This approach makes possible the analysis of a wide class of inhomogeneous-Poisson Voronoi tessellations, by means of formulae and estimates already established for homogeneous cases. Our analysis applies also to the Poisson process modulated by an independent stationary random partition, in which case the error of the approximation of the double-stochastic-Poisson Voronoi tessellation depends on some integrated linear contact distribution functions of the boundaries of the partition elements.

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
Copyright © Applied Probability Trust 2003 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable