相关论文: A near-linear time approximation scheme for $(k,\e…
The Fr\'echet distance is a popular distance measure for curves. We study the problem of clustering time series under the Fr\'echet distance. In particular, we give $(1+\varepsilon)$-approximation algorithms for variations of the following…
We give the first near-linear time $(1+\eps)$-approximation algorithm for $k$-median clustering of polygonal trajectories under the discrete Fr\'{e}chet distance, and the first polynomial time $(1+\eps)$-approximation algorithm for…
Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…
We present an algorithm for computing $\epsilon$-coresets for $(k, \ell)$-median clustering of polygonal curves in $\mathbb{R}^d$ under the Fr\'echet distance. This type of clustering is an adaption of Euclidean $k$-median clustering: we…
We study approximate-near-neighbor data structures for time series under the continuous Fr\'echet distance. For an attainable approximation factor $c>1$ and a query radius $r$, an approximate-near-neighbor data structure can be used to…
The Euclidean $k$-center problem is a classical problem that has been extensively studied in computer science. Given a set $\mathcal{G}$ of $n$ points in Euclidean space, the problem is to determine a set $\mathcal{C}$ of $k$ centers (not…
We study subtrajectory clustering under the Fr\'echet distance. Given one or more trajectories, the task is to split the trajectories into several parts, such that the parts have a good clustering structure. We approach this problem via a…
The discrete Fr{\'e}chet distance is a measure of similarity between point sequences which permits to abstract differences of resolution between the two curves, approximating the original Fr{\'e}chet distance between curves. Such distance…
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 recent hardness results for the minimum-enclosing-ball…
In 2015, Driemel, Krivo\v{s}ija and Sohler introduced the $(k,\ell)$-median problem for clustering polygonal curves under the Fr\'echet distance. Given a set of input curves, the problem asks to find $k$ median curves of at most $\ell$…
The discrete Fr\'echet distance is a useful similarity measure for comparing two sequences of points $P=(p_1,\ldots, p_m)$ and $Q=(q_1,\ldots,q_n)$. In many applications, the quality of the matching can be improved if we let $Q$ undergo…
The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…
The Fr\'echet distance is a popular similarity measure that is well-understood for polygonal curves in $\mathbb{R}^d$: near-quadratic time algorithms exist, and conditional lower bounds suggest that these results cannot be improved…
Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…
The Fr\'{e}chet distance is a popular distance measure between curves $P$ and $Q$. Conditional lower bounds prohibit $(1 + \varepsilon)$-approximate Fr\'{e}chet distance computations in strongly subquadratic time, even when preprocessing…
We study the $c$-approximate near neighbor problem under the continuous Fr\'echet distance: Given a set of $n$ polygonal curves with $m$ vertices, a radius $\delta > 0$, and a parameter $k \leq m$, we want to preprocess the curves into a…
We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor.…
In this paper, we present a linear-time approximation scheme for $k$-means clustering of \emph{incomplete} data points in $d$-dimensional Euclidean space. An \emph{incomplete} data point with $\Delta>0$ unspecified entries is represented as…
The Fr\'echet distance is a popular measure of dissimilarity for polygonal curves. It is defined as a min-max formulation that considers all direction-preserving continuous bijections of the two curves. Because of its susceptibility to…
The \emph{Fr\'echet distance} is a well studied similarity measures between curves. The \emph{discrete Fr\'echet distance} is an analogous similarity measure, defined for a sequence $A$ of $m$ points and a sequence $B$ of $n$ points, where…