The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$

DOI10.20382/jocg.v7i1a16zbMath1405.68411OpenAlexW2295141444MaRDI QIDQ2970456

Ross Hemsley, Olivier Devillers

Publication date: 30 March 2017

Full work available at URL: https://hal.inria.fr/hal-01348831

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (3)

Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path ⋮ Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation ⋮ Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity

This page was built for publication: The worst visibility walk in a random Delaunay triangulation is $O(\sqrt{n})$