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

DOI10.1142/S0218195918500061zbMath1434.60130OpenAlexW2644198472MaRDI QIDQ4557734

Louis Noizet, Olivier Devillers

Publication date: 26 November 2018

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195918500061

zbMATH Keywords

Poisson point processesDelaunay triangulationstretch ratio

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (2)

Reconstructing embedded graphs from persistence diagrams ⋮ Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity

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
• Online Routing in Triangulations
• The computational geometry algorithms library CGAL
• Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity

This page was built for publication: Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path