On the homogeneous planar Poisson point process

From MaRDI portal
Publication:2539516

DOI10.1016/0025-5564(70)90061-1zbMath0196.19403OpenAlexW2055593169MaRDI QIDQ2539516

R. E. Miles

Publication date: 1970

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(70)90061-1




Related Items (48)

Asymptotics for Voronoi tessellations on random samplesRandom inscribed polytopes have similar radius functions as Poisson-Delaunay mosaicsGLIM and normalising constant models in spatial and directional data analysisComputing relative neighbourhood graphs in the planePROXIMITY GRAPHS: E, δ, Δ, χ AND ωEstimates for distributions of the Voronoi polygon's geometric characteristicsRandom spheres in a convex bodyCombinatorial aspects of geometric graphsDistribution of size, structure and number of vacant regions in a high-intensity mosaicMixed Random MosaicsUnnamed ItemCounting pairs of saddle connectionsConnected spatial networks over random points and a route-length statisticRadius Functions on Poisson–Delaunay Mosaics and Related Complexes ExperimentallyA straightforward iterative algorithm for the planar Voronoi diagramThe Poisson-Voronoi tessellation: relationships for edgesA more comprehensive complementary theorem for the analysis of Poisson point processes\(k\)-nearest-neighbor clustering and percolation theoryPunktprozesse mit WechselwirkungThe \(\gamma\)-neighborhood graphMonte carlo estimates of the distributions of the random polygons determined by random lines in a planeCircumspheres of sets of n + 1 random points in the d-dimensional Euclidean unit ball (1 ≤ n ≤ d)Numerical and Analytical Computation of Some Second-Order Characteristics of Spatial Poisson-Voronoi TessellationsThe various aggregates of random polygons determined by random lines in a planeProperties of the random search in global optimizationOn the number of higher order Delaunay triangulationsThe Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case StudyThe average performance analysis of a closest‐pair algorithmExplicit laws of large numbers for random nearest-neighbour-type graphsLaplace transform identities for the volume of stopping sets based on Poisson point processesDATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONSMonte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson processTwo algorithms for constructing a Delaunay triangulationMeasure Distributions for Some Poisson Process Random Domains and Statistical ApplicationsErgodic theorems for spatial processesWeighted Poisson--Delaunay MosaicsRandom Delaunay simplexes in \({\mathbb{R}}^ m\)Some methods for statistical analysis of planar random tessellationsExpected sizes of Poisson–Delaunay mosaics and their discrete Morse functionsA vector identity for the Dirichlet tessellationCardinality estimation for random stopping sets based on Poisson point processesTopological relationships in spatial tessellationsThe role of spatial pattern in the competition between crop plants and weeds. A theoretical analysisStudies in the robustness of multidimensional scaling: euclidean models and simulation studiesOn the average length of Delaunay triangulationsUnnamed ItemUnnamed ItemRounding Voronoi diagram



Cites Work


This page was built for publication: On the homogeneous planar Poisson point process