Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles

SIAM Journal on Computing, Volume 44, Issue 6, 2015, Pages 1626-1649.

Cited by: 18|Bibtex|Views23|Links
EI
Keywords:
theta graph

Abstract:

We present a deterministic local routing algorithm that is guaranteed to find a path between any pair of vertices in a half-$\theta_6$-graph (the half-$\theta_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/\sqrt{3} \approx 2.887$ times the Euc...More

Code:

Data:

Your rating :
0

 

Tags
Comments