4 papers · 1 filter
Local Routing on Ordered -graphs
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 -graph,…
Spanner for the weighted region problem
Joachim Gudmundsson, Zijin Huang, André van Renssen +1
We consider the problem of computing an approximate weighted shortest path in a weighted subdivision, with weights assigned from the set . We present a data struc…
Shortest Paths of Mutually Visible Robots
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of point robots inside a simple polygon , the task is to move the robots from their starting positions to their target positions along their shortest paths, whil…
Pattern Formation for Fat Robots with Memory
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of autonomous, anonymous, indistinguishable, silent, and possibly disoriented mobile unit disk (i.e., fat) robots operating following Look-Compute-Move cycles…