Reporting flock patterns

  • Authors:
  • Marc Benkert;Joachim Gudmundsson;Florian Hübner;Thomas Wolle

  • Affiliations:
  • Department of Computer Science, Karlsruhe University, Karlsruhe, Germany;National ICT Australia Ltd, Alexandria NSW, Australia;Department of Computer Science, Karlsruhe University, Karlsruhe, Germany;National ICT Australia Ltd, Alexandria NSW, Australia

  • Venue:
  • ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in the form of interesting patterns. One of the most common spatio-temporal patterns sought after is flocks. A flock is a large enough subset of objects moving along paths close to each other for a certain pre-defined time. We give a new definition that we argue is more realistic than the previous ones, and we present fast approximation algorithms to report flocks. The algorithms are analysed both theoretically and experimentally.