9 papers
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
The Mutual Visibility Problem for Fat Robots with Lights
Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen
Given a set of unit disk robots in the Euclidean plane, we consider the fundamental problem of providing mutual visibility to them: the robots must reposition themselves…
Oriented Spanners
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb +4
Given a point set in the Euclidean plane and a parameter , we define an \emph{oriented -spanner} as an oriented subgraph of the complete bi-directed graph such that f…
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…
Local Routing on Ordered -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 -graph,…
A WSPD, Separator and Small Tree Cover for c-packed Graphs
Lindsey Deryckere, Joachim Gudmundsson, André van Renssen +2
The -packedness property, proposed in 2010, is a geometric property that captures the spatial distribution of a set of edges. Despite the recent interest in -packedness, its…