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

22 citations · 28 across the 13 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.CG2022

Data Structures for Approximate Discrete Fréchet Distance

Ivor van der Hoog, Eva Rotenberg, Sampson Wong

The Fréchet distance is a popular distance measure between curves and . Conditional lower bounds prohibit -approximate Fréchet distance computations in st…

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.CG2022

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation

Andrè van Renssen, Yuan Sha, Yucheng Sun +1

Spanner construction is a well-studied problem and Delaunay triangulations are among the most popular spanners. Tight bounds are known if the Delaunay triangulation is constructed…

cs.CG2022★ 3 cited

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

Joachim Gudmundsson, Martin P. Seybold, Sampson Wong

Map matching is a common preprocessing step for analysing vehicle trajectories. In the theory community, the most popular approach for map matching is to compute a path on the road…

cs.CG2022

Computing Continuous Dynamic Time Warping of Time Series in Polynomial Time

Kevin Buchin, André Nusser, Sampson Wong

Dynamic Time Warping is arguably the most popular similarity measure for time series, where we define a time series to be a one-dimensional polygonal curve. The drawback of Dynamic…