A framework for trajectory segmentation by stable criteria

We present an algorithmic framework for criteria-based segmentation of trajectories that can efficiently process a large class of criteria. Criteria-based segmentation is the problem of subdividing a trajectory into a small number of parts such that each part satisfies a global criterion. Our framework can handle criteria that are stable, in the sense that these do not change their validity along the trajectory very often. This includes both increasing and decreasing monotone criteria. Our framework takes O(n log n) time for preprocessing and computation, where n is the number of data points. It surpasses the two previous algorithmic frameworks on criteria-based segmentation, which could only handle decreasing monotone criteria, or had a quadratic running time, respectively. Furthermore, we develop an efficient data structure for interactive parameter selection, and provide mechanisms to improve the exact position of break points in the segmentation. We demonstrate and evaluate our framework by performing case studies on real-world data sets