activity
20192022
most cited(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping

22 citations · 24 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CG2022

Approximating the lambda-low-density value

Joachim Gudmundsson, Zijin Huang, Sampson Wong

The use of realistic input models has gained popularity in the theory community. Assuming a realistic input model often precludes complicated hypothetical inputs, and the analysis…

cs.CG2021

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

Joachim Gudmundsson, Sampson Wong

Detecting commuting patterns or migration patterns in movement data is an important problem in computational movement analysis. Given a trajectory, or set of trajectories, this cor…

cs.CG2021

Translation Invariant Fréchet Distance Queries

Joachim Gudmundsson, André van Renssen, Zeinab Saeidi +1

The Fréchet distance is a popular similarity measure between curves. For some applications, it is desirable to match the curves under translation before computing the Fréchet dista…

cs.LG202022 cited

(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping

Milutin Brankovic, Kevin Buchin, Koen Klaren +3

Due to the massively increasing amount of available geospatial data and the need to present it in an understandable way, clustering this data is more important than ever. As cluste…

cs.CG20201 cited

Approximating the packedness of polygonal curves

Joachim Gudmundsson, Yuan Sha, Sampson Wong

In 2012 Driemel et al. \cite{DBLP:journals/dcg/DriemelHW12} introduced the concept of -packed curves as a realistic input model. In the case when is a constant they gave a n…

cs.CG20191 cited

Computing the Yolk in Spatial Voting Games without Computing Median Lines

Joachim Gudmundsson, Sampson Wong

The yolk is an important concept in spatial voting games as it generalises the equilibrium and provides bounds on the uncovered set. We present near-linear time algorithms for comp…