Straight-path queries in trajectory data

M.T. Berg, de, A.D. Mehrabi

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)
131 Downloads (Pure)


Inspired by sports analysis, we study data structures for storing a trajectory representing the movement of a player during a game, such that the following queries can be answered: Given two positions s and t, report all sub-trajectories in which the player moved in a more or less straight line from s to t. We consider two measures of straightness, namely dilation and direction deviation , we present efficient construction algorithms for our data structures, and we analyze their performance. We also present an O(n^{1.5¿+¿e}) algorithm for the following simplification problem: given a trajectory P and a threshold t, find a simplification of P with a minimum number of vertices such that each edge in the simplification replaces a sub-trajectory whose length is at most t times the length of the edge. This significantly improves the fastest known algorithm for the problem. Keywords: Trajectory data; Data structures; Path simplification problem
Original languageEnglish
Pages (from-to)27-38
JournalJournal of Discrete Algorithms
Issue numberWalcom 2015
Publication statusPublished - 2016
Event9th International Workshop on Algorithms and Computation (WALCOM 2015) - Dhaka, Bangladesh
Duration: 26 Feb 201528 Feb 2015
Conference number: 9


Dive into the research topics of 'Straight-path queries in trajectory data'. Together they form a unique fingerprint.

Cite this