We present a deterministic local routing algorithm that is guaranteed to find a path between any pair of vertices in a half-θ 6 -graph (the half-θ 6 -graph is equivalent to the Delaunay triangulation where the empty region is an equilateral triangle). The length of the path is at most 5/ √ 3 ≈ 2.887 times the Euclidean distance between the pair of vertices. Moreover, we show that no local routing algorithm can achieve a better routing ratio, thereby proving that our routing algorithm is

more »

... This is somewhat surprising because the spanning ratio of the half-θ 6 -graph is 2, meaning that even though there always exists a path whose length is at most twice the Euclidean distance, we cannot always find such a path when routing locally. Since every triangulation can be embedded in the plane as a half-θ 6 -graph using O(log n) bits per vertex coordinate via Schnyder's embedding scheme [W. Schnyder, Embedding planar graphs on the grid, in our result provides a competitive local routing algorithm for every such embedded triangulation. Finally, we show how our routing algorithm can be adapted to provide a routing ratio of 15/ √ 3 ≈ 8.660 on two bounded degree subgraphs of the half-θ 6 -graph.