An optimal greedy routing algorithm for triangulated polygons

DOI10.1016/j.comgeo.2013.02.002zbMath1273.68281OpenAlexW1980738195MaRDI QIDQ1947976

Huaming Zhang, Omkar Kulkarni

Publication date: 29 April 2013

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

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

zbMATH Keywords

greedy routingstretch factor

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy routing via embedding graphs onto semi-metric spaces
• Some results on greedy embeddings in metric spaces
• On a conjecture related to geometric routing
• Distributed computation of virtual coordinates
• Succinct Greedy Graph Drawing in the Hyperbolic Plane
• Succinct Greedy Geometric Routing in the Euclidean Plane
• An Algorithm to Construct Greedy Drawings of Triangulations

This page was built for publication: An optimal greedy routing algorithm for triangulated polygons