Joachim Gudmundsson | DeepAI

AI Chat

Featured Co-authors

Toby Walsh
98 publications
Haris Aziz
61 publications
Maarten Löffler
42 publications
Nicholas Mattei
41 publications
Irina Kostitsyna
28 publications
Pat Morin
26 publications
Mark de Berg
24 publications
Kevin Buchin
24 publications
André van Renssen
23 publications
Anne Driemel
22 publications
Serge Gaspers
20 publications

∙ 07/20/2023

Computing a Subtrajectory Cluster from c-packed Trajectories

We present a near-linear time approximation algorithm for the subtraject...

0 Joachim Gudmundsson, et al. ∙

∙ 06/29/2023

Oriented Spanners

Given a point set P in the Euclidean plane and a parameter t, we define ...

0 Kevin Buchin, et al. ∙

∙ 06/26/2023

Pattern Formation for Fat Robots with Lights

Given a set of n≥ 1 unit disk robots in the Euclidean plane, we consider...

0 Rusul J. Alsaedi, et al. ∙

∙ 11/13/2022

Approximating the lambda-low-density value

The use of realistic input models has gained popularity in the theory co...

0 Joachim Gudmundsson, et al. ∙

∙ 11/05/2022

Map matching queries on realistic input graphs under the Fréchet distance

Map matching is a common preprocessing step for analysing vehicle trajec...

0 Joachim Gudmundsson, et al. ∙

∙ 06/29/2022

The Mutual Visibility Problem for Fat Robots

Given a set of n ≥ 1 unit disk robots in the Euclidean plane, we conside...

0 Rusul J. Alsaedi, et al. ∙

∙ 04/04/2022

Partitioning axis-parallel lines in 3D

Let L be a set of n axis-parallel lines in ℝ^3. We are are interested in...

0 Boris Aronov, et al. ∙

∙ 03/19/2022

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance

We study the problem of sub-trajectory nearest-neighbor queries on polyg...

0 Joachim Gudmundsson, et al. ∙

∙ 02/03/2022

Exploring Sub-skeleton Trajectories for Interpretable Recognition of Sign Language

Recent advances in tracking sensors and pose estimation software enable ...

0 Joachim Gudmundsson, et al. ∙

∙ 12/23/2021

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size

Given a set of n sites from ℝ^d, each having some positive weight factor...

0 Joachim Gudmundsson, et al. ∙

∙ 10/29/2021

Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance

Detecting commuting patterns or migration patterns in movement data is a...

0 Joachim Gudmundsson, et al. ∙

∙ 02/11/2021

Translation Invariant Fréchet Distance Queries

The Fréchet distance is a popular similarity measure between curves. For...

0 Joachim Gudmundsson, et al. ∙

∙ 01/25/2021

Covering a set of line segments with a few squares

We study three covering problems in the plane. Our original motivation f...

0 Joachim Gudmundsson, et al. ∙

∙ 01/13/2021

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures

We revisit the randomized incremental construction of the Trapezoidal Se...

0 Joachim Gudmundsson, et al. ∙

∙ 12/02/2020

Local Routing in a Tree Metric 1-Spanner

Solomon and Elkin constructed a shortcutting scheme for weighted trees w...

0 Milutin Brankovic, et al. ∙

∙ 09/16/2020

Approximating the packedness of polygonal curves

In 2012 Driemel et al. <cit.> introduced the concept of c-packed curves ...

0 Joachim Gudmundsson, et al. ∙

∙ 07/24/2020

Improving the dilation of a metric graph by adding edges

Most of the literature on spanners focuses on building the graph from sc...

0 Joachim Gudmundsson, et al. ∙

∙ 05/28/2020

A Practical Index Structure Supporting Fréchet Proximity Queries Among Trajectories

We present a scalable approach for range and k nearest neighbor queries ...

0 Joachim Gudmundsson, et al. ∙

∙ 03/17/2020

On beta-Plurality Points in Spatial Voting Games

Let V be a set of n points in ℝ^d, called voters. A point p∈ℝ^d is a plu...

0 Boris Aronov, et al. ∙

∙ 09/23/2019

Local Routing in Sparse and Lightweight Geometric Graphs

Online routing in a planar embedded graph is central to a number of fiel...

0 Vikrant Ashvinkumar, et al. ∙

∙ 02/13/2019

Computing the Yolk in Spatial Voting Games without Computing Median Lines

The yolk is an important concept in spatial voting games as it generalis...

0 Joachim Gudmundsson, et al. ∙

∙ 05/03/2018

Approximating (k,ℓ)-center clustering for curves

The Euclidean k-center problem is a classical problem that has been exte...

0 Kevin Buchin, et al. ∙

∙ 10/28/2017

Fast Fréchet Distance Between Curves With Long Edges

Computing Fréchet distance between two curves takes roughly quadratic ti...

0 Joachim Gudmundsson, et al. ∙

∙ 03/27/2017

A Visual Measure of Changes to Weighted Self-Organizing Map Patterns

Estimating output changes by input changes is the main task in causal an...

0 Younjin Chung, et al. ∙

∙ 07/19/2016

Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees

We consider the problem of augmenting an n-vertex graph embedded in a me...

0 Ulrike Große, et al. ∙

∙ 02/22/2016

Spatio-Temporal Analysis of Team Sports -- A Survey

Team-based invasion sports such as football, basketball and hockey are s...

0 Joachim Gudmundsson, et al. ∙

∙ 07/11/2014

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use ...

0 Haris Aziz, et al. ∙

∙ 01/15/2010

Planar Visibility: Testing and Counting

In this paper we consider query versions of visibility testing and visib...

0 Joachim Gudmundsson, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world