Approximating (k,ℓ)-Median Clustering for Polygonal Curves
In 2015, Driemel, Krivošija, and Sohler introduced the k, ℓ-median clustering problem for
polygonal curves under the Fréchet distance. Given a set of input curves, the problem asks …
polygonal curves under the Fréchet distance. Given a set of input curves, the problem asks …
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
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 …
present it in an understandable way, clustering this data is more important than ever. As …
On the hardness of computing an average curve
We study the complexity of clustering curves under $ k $-median and $ k $-center objectives
in the metric space of the Fr\'echet distance and related distance measures. Building upon …
in the metric space of the Fr\'echet distance and related distance measures. Building upon …
Proposal for a pivot-based vehicle trajectory clustering method
Given the large volume of georeferenced information generated and stored by many types of
devices, the study and improvement of techniques capable of operating with these data is an …
devices, the study and improvement of techniques capable of operating with these data is an …
Computing safe stop trajectories for autonomous driving utilizing clustering and parametric optimization
In the realm of autonomous driving, ensuring a secure halt is imperative across diverse
scenarios, ranging from routine stops at traffic lights to critical situations involving detected …
scenarios, ranging from routine stops at traffic lights to critical situations involving detected …
Online research topic modeling and recommendation utilizing multiview autoencoder-based approach
Recent years have witnessed tremendous growth in the publication of research articles as
well as in the rise of new research topics. Articles get published in a streaming manner and …
well as in the rise of new research topics. Articles get published in a streaming manner and …
Private aggregation of trajectories
In this paper, we study the task of aggregating user-generated trajectories in a differentially
private manner. We present a new algorithm for this problem and demonstrate its …
private manner. We present a new algorithm for this problem and demonstrate its …
[HTML][HTML] Computing the Fréchet distance between uncertain curves in one dimension
We consider the problem of computing the Fréchet distance between two curves for which
the exact locations of the vertices are unknown. Each vertex may be placed in a given …
the exact locations of the vertices are unknown. Each vertex may be placed in a given …
Representative Routes Discovery from Massive Trajectories
In this work, we study how to find the k most representative routes over large scale trajectory
data, which is a fundamental operation that benefits various real-world applications, such as …
data, which is a fundamental operation that benefits various real-world applications, such as …
Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
K Bringmann, A Nusser - arXiv preprint arXiv:2101.07696, 2021 - arxiv.org
Computing the similarity of two point sets is a ubiquitous task in medical imaging, geometric
shape comparison, trajectory analysis, and many more settings. Arguably the most basic …
shape comparison, trajectory analysis, and many more settings. Arguably the most basic …