Pages that link to "Item:Q2539516"

The following pages link to On the homogeneous planar Poisson point process (Q2539516):

Displaying 48 items.

• On the number of higher order Delaunay triangulations (Q551184) (← links)
• Random Delaunay simplexes in \({\mathbb{R}}^ m\) (Q749005) (← links)
• Connected spatial networks over random points and a route-length statistic (Q906528) (← links)
• A straightforward iterative algorithm for the planar Voronoi diagram (Q910230) (← links)
• On the average length of Delaunay triangulations (Q1062440) (← links)
• Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
• Random spheres in a convex body (Q1119256) (← links)
• The \(\gamma\)-neighborhood graph (Q1194312) (← links)
• The various aggregates of random polygons determined by random lines in a plane (Q1211777) (← links)
• Properties of the random search in global optimization (Q1212869) (← links)
• GLIM and normalising constant models in spatial and directional data analysis (Q1330527) (← links)
• Combinatorial aspects of geometric graphs (Q1384214) (← links)
• Rounding Voronoi diagram (Q1603650) (← links)
• Asymptotics for Voronoi tessellations on random samples (Q1613642) (← links)
• Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics (Q1617163) (← links)
• \(k\)-nearest-neighbor clustering and percolation theory (Q2461550) (← links)
• The role of spatial pattern in the competition between crop plants and weeds. A theoretical analysis (Q2562762) (← links)
• Laplace transform identities for the volume of stopping sets based on Poisson point processes (Q2786420) (← links)
• Topological relationships in spatial tessellations (Q3111051) (← links)
• Distribution of size, structure and number of vacant regions in a high-intensity mosaic (Q3217338) (← links)
• Mixed Random Mosaics (Q3217339) (← links)
• The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
• Explicit laws of large numbers for random nearest-neighbour-type graphs (Q3590741) (← links)
• Numerical and Analytical Computation of Some Second-Order Characteristics of Spatial Poisson-Voronoi Tessellations (Q3842738) (← links)
• Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process (Q3870139) (← links)
• Two algorithms for constructing a Delaunay triangulation (Q3883495) (← links)
• A vector identity for the Dirichlet tessellation (Q3918678) (← links)
• Studies in the robustness of multidimensional scaling: euclidean models and simulation studies (Q3930485) (← links)
• Estimates for distributions of the Voronoi polygon's geometric characteristics (Q3990218) (← links)
• Punktprozesse mit Wechselwirkung (Q4094224) (← links)
• Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane (Q4114681) (← links)
• Ergodic theorems for spatial processes (Q4181074) (← links)
• DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS (Q4682200) (← links)
• Some methods for statistical analysis of planar random tessellations (Q4721302) (← links)
• Cardinality estimation for random stopping sets based on Poisson point processes (Q4990911) (← links)
• Radius Functions on Poisson–Delaunay Mosaics and Related Complexes Experimentally (Q5118366) (← links)
• (Q5165381) (← links)
• (Q5165389) (← links)
• Weighted Poisson--Delaunay Mosaics (Q5216293) (← links)
• Expected sizes of Poisson–Delaunay mosaics and their discrete Morse functions (Q5233188) (← links)
• PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
• The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study (Q5360331) (← links)
• A more comprehensive complementary theorem for the analysis of Poisson point processes (Q5395351) (← links)
• Measure Distributions for Some Poisson Process Random Domains and Statistical Applications (Q5459751) (← links)
• The Poisson-Voronoi tessellation: relationships for edges (Q5694145) (← links)
• Circumspheres of sets of <i>n</i> + 1 random points in the <i>d</i>-dimensional Euclidean unit ball (1 ≤ <i>n</i> ≤ <i>d</i>) (Q5738710) (← links)
• (Q5859883) (← links)
• Counting pairs of saddle connections (Q6052167) (← links)