… We consider online routing algorithms for routing between the vertices of embedded planar
… memoryless routing algorithms, one that works for all Delaunay triangulations and the other …

… We consider online routing strategies for routing between the vertices of embedded planar
… memoryless routing strategies, one that works for all Delaunay triangulations and the other …

… triangulations from the previous best of 45.749. We present a 7.621-competitive online routing
algorithm for Delaunay triangulations … online routing algorithm on Delaunay triangulations …

… We present an online routing algorithm on the Delaunay triangulation with routing ratio less
than … Our Results We present an online routing algorithm on Delaunay triangulations that has …

… Routing algorithms designed for such scenarios are called online routing algorithms in [1],
[2], [3], and [4]. To be specific, this paper considers online routing in the same settings as …

… that in fact, the routing strategy works for all plane … online routing algorithm for routing on
triangulated polygons with two ears. Section 4 presents our results for routing on triangulations …

… We consider online routing algorithms for finding paths between the vertices of plane graphs.
We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory …

… We consider online routing algorithms for routing between the vertices of embedded planar
… memoryless routing algorithms, one that works for all Delaunay triangulations and the other …

… In an intuitive sense at least, triangulations are the most stnictured form of … online routing
algorith. With this in mind, we begin by studying the simplest routing algorithms for triangulations…

… an online routing algorithm on Delaunay triangulations prior to our results. We apply a new
strategy to define an online routing … 3, we examine Delaunay triangulations of sets of points in …