We present algorithms and data structures that support the interactive analysis of the grouping structure of one-, two-, or higher-dimensional time-varying data while varying all defining parameters. Grouping structures characterise important patterns in the temporal evaluation of sets of time-varying data. We follow Buchin et al. [JoCG 2015] who define groups using three parameters: group-size, group-duration, and inter-entity distance. We give upper and lower bounds on the number of maximal groups over all parameter values, and show how to compute them efficiently. Furthermore, we describe data structures that can report changes in the set of maximal groups in an output-sensitive manner. Our results hold in R^d for fixed d.
|Title of host publication||Proc. of the 32nd annual Symposium on Computational Geometry (SoCG)|
|Publication status||Published - 2016|
|Event||32nd International Symposium on Computational Geometry (SoCG 2016) - Boston, United States|
Duration: 14 Jun 2016 → 18 Jun 2016
|Conference||32nd International Symposium on Computational Geometry (SoCG 2016)|
|Period||14/06/16 → 18/06/16|