Computing longest duration flocks in trajectory data

by Joachim Gudmundsson, Marc van Kreveld
Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems ()


Moving point object data can be analyzed through the dis- covery of patterns. We consider the computational e±ciency of computing two of the most basic spatio-temporal pat- terns in trajectories, namely °ocks and meetings. The pat- terns are large enough subgroups of the moving point objects that exhibit similar movement and proximity for a certain amount of time. We consider the problem of computing a longest duration °ock or meeting. We give several exact and approximation algorithms, and also show that some variants are as hard as MaxClique to compute and approximate.

Cite this document (BETA)

Readership Statistics

46 Readers on Mendeley
by Discipline
by Academic Status
39% Ph.D. Student
11% Student (Master)
11% Student (Bachelor)
by Country
9% Brazil
2% Germany
2% India

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in