Local Routing in Convex Subdivisions
From MaRDI portal
Publication:5149568
DOI10.1142/S0218195920500016zbMath1458.68027OpenAlexW3082387259MaRDI QIDQ5149568
Stephane Durocher, Maxime Peabody, Debajyoti Mondal, Matthew Skala, Mohammad Abdul Wahid, Prosenjit Bose
Publication date: 11 February 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195920500016
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Wireless sensor networks as related to computer science (68M18)
Cites Work
- Memoryless routing in convex subdivisions: random walks are optimal
- Competitive online routing in geometric graphs
- Bounding the locality of distributed routing algorithms
- Online Routing in Triangulations
- ONLINE ROUTING IN CONVEX SUBDIVISIONS
- AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
- Local Routing in Convex Subdivisions
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
- Routing with guaranteed delivery in ad hoc wireless networks
This page was built for publication: Local Routing in Convex Subdivisions
