Computing longest duration flocks in trajectory data

Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in trajectories, namely flocks and meetings. The patterns 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 flock or meeting. We give several exact and approximation algorithms, and also show that some variants are as hard as MaxClique to compute and approximate. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms: Algorithms, Theory.

• Type: Conference
• Year: 2006
• Where: GIS
• Authors: Joachim Gudmundsson, Marc J. van Kreveld
• Keywords: Approximation Algorithms, Basic Spatio-temporal Patterns, Database, GIS 2006, Nonnumerical Algorithms