HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Stretch Factor in a Planar Poisson-Delaunay Triangulation with a Large Intensity

Nicolas Chenavier 1 Olivier Devillers 2
2 GAMBLE - Geometric Algorithms and Models Beyond the Linear and Euclidean realm
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : Let $X := X_n ∪ \{(0, 0), (1, 0)\}$, where $X_n$ is a planar Poisson point process of intensity $n$. We provide a first non-trivial lower bound for the distance between the expected length of the shortest path between (0, 0) and (1, 0) in the Delaunay triangulation associated with $X$ when the intensity of $X_n$ goes to infinity. Simulations indicate that the correct value is about 1.04. We also prove that the expected length of the so-called upper path converges to $35/3\pi^2$, giving an upper bound for the expected length of the smallest path.
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

Contributor : Olivier Devillers Connect in order to contact the contributor
Submitted on : Monday, February 5, 2018 - 11:35:16 AM
Last modification on : Tuesday, March 29, 2022 - 12:43:43 PM
Long-term archiving on: : Monday, May 7, 2018 - 11:46:09 AM


Files produced by the author(s)



Nicolas Chenavier, Olivier Devillers. Stretch Factor in a Planar Poisson-Delaunay Triangulation with a Large Intensity. Advances in Applied Probability, Applied Probability Trust, 2018, 50 (1), pp.35-56. ⟨10.1017/apr.2018.3⟩. ⟨hal-01700778⟩



Record views


Files downloads