Local Routing on Ordered $\Theta$-graphs

André van Renssen, André van Renssen, Shuei Sakaguchi

The problem of locally routing on geometric networks using limited memory is extensively studied in computational geometry. We consider one particular graph, the ordered $\Theta$-graph,…