Clustering trajectories is a central challenge when confronted with larg...
We study range spaces, where the ground set consists of polygonal curves...
We consider the (1+ε)-Approximate Nearest Neighbour (ANN) Problem
for po...
In this paper, we analyze the approximation quality of a greedy heuristi...
In this work, we consider the problem of pattern matching under the dyna...
Subtrajectory clustering is an important variant of the trajectory clust...
We apply state-of-the-art computational geometry methods to the problem ...
The Fréchet distance is a popular measure of dissimilarity for polygonal...
The Fréchet distance is a well-studied similarity measure between curves...
We study variants of the mean problem under the p-Dynamic Time Warping
(...
We study the c-approximate near neighbor problem under the continuous
Fr...
We study subtrajectory clustering under the Fréchet distance. Given one ...
We study the problem of finding the k most similar trajectories to a giv...
In 2015, Driemel, Krivošija and Sohler introduced the (k,ℓ)-median
probl...
We study approximate-near-neighbor data structures for time series under...
We study metric data structures for curves in doubling spaces, such as
t...
The Vapnik-Chervonenkis dimension provides a notion of complexity for sy...
We study the complexity of clustering curves under k-median and k-center...
Massive datasets of curves, such as time series and trajectories, are
co...
The Fréchet distance is a popular distance measure for curves which
natu...
The Euclidean k-center problem is a classical problem that has been
exte...
Modern tracking technology has made the collection of large numbers of
d...