A Refined Definition for Groups of Moving Entities and Its Computation
Marc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma · International Journal of Computational Geometry & Applications · 2018
One of the important tasks in the analysis of spatio-temporal data collected from moving entities is to find a group: a set of entities that travel together for a sufficiently long period of time. Buchin et al.2 introduce a formal definition of groups, analyze its mathematical structure, and present efficient algorithms for computing all maximal groups in a given set of trajectories. In this paper, we refine their definition and argue that our proposed definition corresponds better to human intuition in certain cases, particularly in dense environments. We present algorithms to compute all maximal groups from a set of moving entities according to the new definition. For a set of [Formula: see text] moving entities in [Formula: see text], specified by linear interpolation in a sequence of [Formula: see text] time stamps, we show that all maximal groups can be computed in [Formula: see text] time. A similar approach applies if the time stamps of entities are not the same, at the cost of a small extra factor of [Formula: see text] in the running time, where [Formula: see text] denotes the inverse Ackermann function. In higher dimensions, we can compute all maximal groups in [Formula: see text] time (for any constant number of dimensions), regardless of whether the time stamps of entities are the same or not. We also show that one [Formula: see text] factor can be traded for a much higher dependence on [Formula: see text] by giving a [Formula: see text] algorithm for the same problem. Consequently, we give a linear-time algorithm when the number of entities is constant and the input size relates to the number of time stamps of each entity. Finally, we provide a construction to show that it might be difficult to develop an algorithm with polynomial dependence on [Formula: see text] and linear dependence on [Formula: see text].