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

no code implementations • 1 Dec 2020 • Milutin Brankovic, Kevin Buchin, Koen Klaren, André Nusser, Aleksandr Popov, Sampson Wong

We develop the first clustering algorithm under this distance measure and show a practical way to compute a center from a set of trajectories and subsequently iteratively improve it.

Clustering Dynamic Time Warping +1

Fréchet Distance for Uncertain Curves

no code implementations • 24 Apr 2020 • Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen

We prove that both the upper and lower bound problems are NP-hard for the continuous Fr\'echet distance in several uncertainty models, and that the upper bound problem remains hard for the discrete Fr\'echet distance.

Computational Geometry