Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
From MaRDI portal
Publication:724951
DOI10.1007/s00454-017-9866-yzbMath1428.60025OpenAlexW2513861046MaRDI QIDQ724951
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
Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Uses Software
Cites Work
- On the stabbing number of a random Delaunay triangulation
- Expected time analysis for Delaunay point location
- Efficiently navigating a random Delaunay triangulation
- The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$
- WALKING IN A TRIANGULATION
- Stochastic and Integral Geometry
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks