Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
From MaRDI portal
(Redirected from Publication:724951)
Recommendations
- scientific article; zbMATH DE number 176773
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
- Contact and Chord Length Distribution Functions of the Poisson-Voronoi Tessellation in High Dimensions
- The probabilistic complexity of the Voronoi diagram of points on a polyhedron
- On the average length of Delaunay triangulations
- Upper and lower bounds for the route length of first-passage percolation in Voronoi tessellations
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
- Expected sizes of Poisson-Delaunay mosaics and their discrete Morse functions
Cites work
- Expected time analysis for Delaunay point location
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- On the stabbing number of a random Delaunay triangulation
- Stochastic and Integral Geometry
- The worst visibility walk in a random Delaunay triangulation is \(O(\sqrt n)\)
- WALKING IN A TRIANGULATION
Cited in
(3)
This page was built for publication: Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724951)