Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
DOI10.1007/S00186-005-0036-2zbMATH Open1081.60007OpenAlexW2041281626MaRDI QIDQ811978FDOQ811978
Authors: Catherine Gloaguen, Frank Fleischer, Hendrik Schmidt, Volker Schmidt
Publication date: 23 January 2006
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-005-0036-2
Recommendations
- Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
- Precise formulae for the distributions of the principal geometric characteristics of the typical cells of a two-dimensional Poisson-Voronoi tessellation and a Poisson line process
- Random tessellations and Cox processes
- Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
- Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations
Geometric probability and stochastic geometry (60D05) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random tessellations in ℝd
- Distributional properties of the typical cell of stationary iterated tessellations
- Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
Cited In (11)
- Empirical (Typical) Cells of the Poisson Medial Tessellation
- Shortest path distance in Manhattan Poisson line Cox process
- Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
- Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
- Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
- Empirical polygon simulation and central limit theorems for the homogeneous Poisson line process
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks
- Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations
- A stochastic model for multi-hierarchical networks
- Densities of Shortest Path Lengths in Spatial Stochastic Networks
This page was built for publication: Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811978)