Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
DOI10.1007/S00454-017-9866-YzbMATH Open1428.60025OpenAlexW2513861046MaRDI QIDQ724951FDOQ724951
Authors: Pedro Machado Manhães de Castro, Olivier Devillers 
Publication date: 26 July 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-017-9866-y
Recommendations
- scientific article; zbMATH DE number 176773
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
- Contact and Chord Length Distribution Functions of the Poisson-Voronoi Tessellation in High Dimensions
- The probabilistic complexity of the Voronoi diagram of points on a polyhedron
- On the average length of Delaunay triangulations
- Upper and lower bounds for the route length of first-passage percolation in Voronoi tessellations
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Expected sizes of Poisson-Delaunay mosaics and their discrete Morse functions
Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Geometric probability and stochastic geometry (60D05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- WALKING IN A TRIANGULATION
- Stochastic and Integral Geometry
- Expected time analysis for Delaunay point location
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- The worst visibility walk in a random Delaunay triangulation is \(O(\sqrt n)\)
- On the stabbing number of a random Delaunay triangulation
Cited In (3)
Uses Software
This page was built for publication: Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724951)
