Fast and efficient restricted Delaunay triangulation in random geometric graphs

DOI10.1080/15427951.2008.10129164zbMATH Open1195.68103OpenAlexW2041623322MaRDI QIDQ3400883FDOQ3400883

Authors: Chen Avin 

Publication date: 27 January 2010

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2008.10129164

Recommendations

• Geometrically aware communication in random wireless networks
• Communication-efficient construction of the plane localized Delaunay graph
• Principles of Distributed Systems
• scientific article; zbMATH DE number 6297797
• Improved routing on the Delaunay triangulation

zbMATH Keywords

long Delaunay edges

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
• Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

This page was built for publication: Fast and efficient restricted Delaunay triangulation in random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400883)