Joachim Gudmundsson

activity

20232026

collaborators

6 papers

cs.CG2026

Linear time single-source shortest path algorithms in Euclidean graph classes

Joachim Gudmundsson, Yuan Sha, Sampson Wong

In the celebrated paper of Henzinger, Klein, Rao and Subramanian (1997), it was shown that planar graphs admit a linear time single-source shortest path algorithm. Their algorithm…

cs.CG2026

Minimum Exposure Motion Planning

Sarita de Berg, Joachim Gudmundsson, Peter Kramer +2

We investigate multiple fundamental variants of the classic coordinated motion planning (CMP) problem for unit square robots in the plane under the $L_{1}$ metric. In coordinated mot…

cs.CG2025

A WSPD, Separator and Small Tree Cover for c-packed Graphs

Lindsey Deryckere, Joachim Gudmundsson, André van Renssen +2

The $c$ -packedness property, proposed in 2010, is a geometric property that captures the spatial distribution of a set of edges. Despite the recent interest in $c$ -packedness, its…

cs.CG2024

Spanner for the $0/1/\infty$ 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 ${0, 1, \infty}$ . We present a data struc…

cs.CG2023

Shortest Paths of Mutually Visible Robots

Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen

Given a set of $n$ point robots inside a simple polygon $P$ , the task is to move the robots from their starting positions to their target positions along their shortest paths, whil…