Simplification of Trajectory Streams

Abstract: While there are software systems that simplify trajectory streams on the fly, few curve simplification algorithms with quality guarantees fit the streaming requirements. We present streaming algorithms for two such problems under the Fr\'{e}chet distance $d_F$ in $\mathbb{R}<sup>d$ for some constant $d \geq 2$. Consider a polygonal curve $\tau$ in $\mathbb{R}<sup>d$ in a stream. We present a streaming algorithm that, for any $\varepsilon\in (0,1)$ and $\delta &gt; 0$, produces a curve $\sigma$ such that $d_F(\sigma,\tau[v_1,v_i])\le (1+\varepsilon)\delta$ and $|\sigma|\le 2\,\mathrm{opt}-2$, where $\tau[v_1,v_i]$ is the prefix in the stream so far, and $\mathrm{opt} = \min{|\sigma&#39;|: d_F(\sigma&#39;,\tau[v_1,v_i])\le \delta}$. Let $$\alpha = 2(d-1){\lfloor d/2 \rfloor}² + d$$. The working storage is $O(\varepsilon<sup>{-\alpha})$. Each vertex is processed in $$O(\varepsilon<sup>{-\alpha}\log\frac{1}{\varepsilon})$$ time for $d \in {2,3}$ and $O(\varepsilon<sup>{-\alpha})$ time for $d \geq 4$ . Thus, the whole $\tau$ can be simplified in $$O(\varepsilon<sup>{-\alpha}|\tau|\log\frac{1}{\varepsilon})$$ time. Ignoring polynomial factors in $1/\varepsilon$, this running time is a factor $|\tau|$ faster than the best static algorithm that offers the same guarantees. We present another streaming algorithm that, for any integer $k \geq 2$ and any $\varepsilon \in (0,\frac{1}{17})$, maintains a curve $\sigma$ such that $|\sigma| \leq 2k-2$ and $d_F(\sigma,\tau[v_1,v_i])\le (1+\varepsilon) \cdot \min{d_F(\sigma&#39;,\tau[v_1,v_i]): |\sigma&#39;| \leq k}$, where $\tau[v_1,v_i]$ is the prefix in the stream so far. The working storage is $$O((k\varepsilon^{{-1}+\varepsilon^{{-(\alpha+1)})\log}} \frac{1}{\varepsilon})$$. Each vertex is processed in $$O(k\varepsilon<sup>{-(\alpha+1)}\log<sup>2\frac{1}{\varepsilon})$$ time for $d \in {2,3}$ and $$O(k\varepsilon<sup>{-(\alpha+1)}\log\frac{1}{\varepsilon})$$ time for $d \geq 4$.