Skip to content
Journal article

Computing longest duration flocks in trajectory data

Gudmundsson J, van Kreveld M ...see all

Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems (2006) pp. 35-42

  • 57


    Mendeley users who have this article in their library.
  • 131


    Citations of this article.
  • N/A


    ScienceDirect users who have downloaded this article.
Sign in to save reference


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.

Author-supplied keywords

  • Approximation algorithms
  • Geometric algorithms
  • Moving objects
  • Spatio-temporal patterns

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Joachim Gudmundsson

  • Marc van Kreveld

Cite this document

Choose a citation style from the tabs below