Authors
Joachim Gudmundsson, Marc van Kreveld, Bettina Speckmann
Publication date
2004/11/12
Book
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Pages
250-257
Description
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of detecting four such spatio-temporal patterns, namely flock, leadership, convergence, and encounter, as defined by Laube et al., 2004. These patterns are large enough subgroups of the moving point objects that exhibit similar movement in the sense of direction, heading for the same location, and/or proximity. By the use of techniques from computational geometry, including approximation algorithms, we improve the running time bounds of existing algorithms to detect these patterns.
Total citations
20032004200520062007200820092010201120122013201420152016201720182019202020212022202320241121010191416201622181016113675141
Scholar articles
J Gudmundsson, M van Kreveld, B Speckmann - Proceedings of the 12th annual ACM international …, 2004