# Segmentation of trajectories for non-monotone criteria

B. Aronov, A. Driemel, M.J. Kreveld, van, M. Löffler, F. Staals

9 Citaten (Scopus)

## Samenvatting

In the trajectory segmentation problem we are given a polygonal trajectory with n vertices that we have to subdivide into a minimum number of disjoint segments (subtrajectories) that all satisfy a given criterion. The problem is known to be solvable efficiently for monotone criteria: criteria with the property that if they hold on a certain segment, they also hold on every subsegment of that segment [4]. To the best of our knowledge, no theoretical results are known for non-monotone criteria. We present a broader study of the segmentation problem, and suggest a general framework for solving it, based on the start-stop diagram: a 2-dimensional diagram that represents all valid and invalid segments of a given trajectory. This yields two subproblems: (i) computing the start-stop diagram, and (ii) finding the optimal segmentation for a given diagram. We show that (ii) is NP-hard in general. However, we identify properties of the start-stop diagram that make the problem tractable, and give polynomial-time algorithm for this case. We study two concrete non-monotone criteria that arise in practical applications in more detail. Both are based on a given univariate attribute function f over the domain of the trajectory. We say a segment satisfies an outlier-tolerant criterion if the value of f lies within a certain range for at least a given percentage of the length of the segment. We say a segment satisfies a standard deviation criterion if the standard deviation of f over the length of the segment lies below a given threshold. We show that both criteria satisfy the properties that make the segmentation problem tractable. In particular, we compute an optimal segmentation of a trajectory based on the outlier-tolerant criterion in O(n^2 log n+kn^2) time, and on the standard deviation criterion in O(kn^2) time, where n is the number of vertices of the input trajectory and k is the number of segments in an optimal solution.
Originele taal-2 Engels Proceedings 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13),6-8 january 2013, New Orleans LA, USA, January 6-8, 2013) Philadelphia PA Society for Industrial and Applied Mathematics (SIAM) 1897-1911 978-1-61197-251-1 https://doi.org/10.1137/1.9781611973105.135 Gepubliceerd - 2013 Ja 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013) - Astor Crowne Plaza Hotel, New Orleans, Verenigde Staten van AmerikaDuur: 6 jan 2013 → 8 jan 2013Congresnummer: 24http://www.siam.org/meetings/da13/

### Congres

Congres 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013) SODA '13 Verenigde Staten van Amerika New Orleans 6/01/13 → 8/01/13 24th Annual ACM-SIAM Symposium on Discrete Algorithms http://www.siam.org/meetings/da13/