Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions

DOI10.1016/j.comgeo.2014.08.008zbMath1307.05056OpenAlexW2137196537MaRDI QIDQ2261582

Antonio Fernández Anta, Esther M. Arkin, Miguel A. Mosteiro, Joseph S. B. Mitchell

Publication date: 6 March 2015

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.08.008

zbMATH Keywords

random geometric graphsradio networksmultidimensional Delaunay graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Computational complexity for the problem of optimal intersection of straight line segments by disks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected spatial networks over random points and a route-length statistic
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
• Communication-Efficient Construction of the Plane Localized Delaunay Graph
• On the expected maximum degree of Gabriel and Yao graphs
• Random Geometric Graphs
• Geometrically aware communication in random wireless networks

This page was built for publication: Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions