Finding long and similar parts of trajectories

@article{Buchin2011FindingLA,
  title={Finding long and similar parts of trajectories},
  author={Kevin Buchin and Maike Buchin and Marc J. van Kreveld and Jun Luo},
  journal={Comput. Geom.},
  year={2011},
  volume={44},
  pages={465-476}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 45 CITATIONS

UvA-DARE ( Digital Academic Repository ) Kernel methods for vessel trajectories

de Vries, D. G.K.
  • 2012
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

OLAP FOR TRAJECTORIES

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Mining K primary corridors from vehicle GPS trajectories on a road network based on traffic flow

  • 2018 13th IEEE Conference on Industrial Electronics and Applications (ICIEA)
  • 2018
VIEW 1 EXCERPT
CITES METHODS

Similar Papers

Loading similar papers…