### Abstract

A natural time-dependent similarity measure for two trajectories is their average distance at corresponding times. We give algorithms for computing the most similar subtrajectories under this measure, assuming the two trajectories are given as two polygonal, possibly self-intersecting lines with time stamps. For the case when a minimum duration of the subtrajectories is specified and the subtrajectories must start at corresponding times, we give a linear-time algorithm. The algorithm is based on a result of independent interest: We present a linear-time algorithm to find, for a piece-wise monotone function, an interval of at least a given length that has minimum average value. In the case that the subtrajectories may start at non-corresponding times, it appears difficult to give exact algorithms, even if the duration of the subtrajectories is fixed. For this case, we give (1+e)-approximation algorithms, for both fixed duration and when only a minimum duration is specified.
Keywords: Trajectory analysis; Similarity measure; Moving objects

Original language | English |
---|---|

Pages (from-to) | 465-476 |

Journal | Computational Geometry |

Volume | 44 |

Issue number | 9 |

DOIs | |

Publication status | Published - 2011 |

## Fingerprint Dive into the research topics of 'Finding long and similar parts of trajectories'. Together they form a unique fingerprint.

## Cite this

Buchin, K., Buchin, M., Kreveld, van, M. J., & Luo, J. (2011). Finding long and similar parts of trajectories.

*Computational Geometry*,*44*(9), 465-476. https://doi.org/10.1016/j.comgeo.2011.05.004