Answers are grounded in this paper and cite their sources.
In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the 'longest' subtrajectory cluster is as hard as MaxClique to compute and approximate.
No takes yet. Share an insight, caveat, or question.
Buchin et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: