Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path - Archive ouverte HAL Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2018

## Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path

(1) , (2, 1)
1
2
Olivier Devillers

#### Abstract

Let $X_n$ be a planar Poisson point process of intensity $n$. We give a new proof that the expected length of the Voronoi path between $(0,0)$ and $(1,0)$ in the Delaunay triangulation associated with $X_n$ is $\tfrac{4}{\pi}\simeq 1.27$ when $n$ goes to infinity; and we also prove that the variance of this length is $\Theta(1/\sqrt{n})$. We investigate the length of possible shortcuts in this path, and define a shortened Voronoi path whose expected length can be expressed as an integral that is numerically evaluated to $\simeq 1.16$. The shortened Voronoi path has the property to be {\em locally defined}; and is shorter than the previously known locally defined paths in Delaunay triangulation such as the upper path whose expected length is $35/3\pi^2\simeq 1.18$.

### Dates and versions

hal-01712628 , version 1 (19-02-2018)

### Identifiers

• HAL Id : hal-01712628 , version 1
• DOI :

### Cite

Olivier Devillers, Louis Noizet. Walking in a Planar Poisson-Delaunay Triangulation: Shortcuts in the Voronoi Path. International Journal of Computational Geometry and Applications, 2018, 28 (3), pp.255-269. ⟨10.1142/S0218195918500061⟩. ⟨hal-01712628⟩

### Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

267 View