An algorithmic framework for segmenting trajectories based on spatio-temporal criteria

In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under which a trajectory can be homogeneous, including location, heading, speed, velocity, curvature, sinuosity, and curviness. We present a framework that allows us to segment any trajectory into a minimum number of segments under any of these criteria, or any combination of these criteria. In this framework, the segmentation problem can generally be solved in O(n log n) time, where n is the number of edges of the trajectory to be segmented. Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms Keywords Trajectory segmentation, geometric algorithms ∗Supported by the German Research Foundation (DFG) un

• Type: Journal
• Year: 2010
• Where: GIS
• Authors: Maike Buchin, Anne Driemel, Marc J. van Kreveld, Vera Sacristan
• Keywords: Algorithms, Automated Reasoning, Different Spatio-temporal Criteria, GIS 2010, Trajectory