Principles of Distributed Systems
From MaRDI portal
Publication:5713697
Recommendations
- Communication-efficient construction of the plane localized Delaunay graph
- Geometrically aware communication in random wireless networks
- A routing algorithm for ad hoc networks based on Delaunay triangulation
- Improved routing on the Delaunay triangulation
- Improved routing on the Delaunay triangulation
Cited in
(13)- DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
- Communication-efficient construction of the plane localized Delaunay graph
- Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks
- Fast and efficient restricted Delaunay triangulation in random geometric graphs
- Towards higher-dimensional topological self-stabilization: a distributed algorithm for Delaunay graphs
- Fast and robust Delaunay tessellation in periodic domains
- Geometrically aware communication in random wireless networks
- Local refinement based on the 7-triangle longest-edge partition
- On plane geometric spanners: a survey and open problems
- A routing algorithm for ad hoc networks based on Delaunay triangulation
- Roaming regions for Delaunay nodes
- Construction of K-Dimensional Delaunay Triangulations Using Local Transformations
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition
This page was built for publication: Principles of Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713697)