Compressing spatio-temporal trajectories

Authors:
Joachim Gudmundsson;Jyrki Katajainen;Damian Merrick;Cahya Ong;Thomas Wolle
Affiliations:
NICTA Sydney, Locked Bag 9013, Alexandria NSW 1435, Australia;Department of Computing, University of Copenhagen, Universitetsparken 1, 2100 Copenhagen East, Denmark;NICTA Sydney, Locked Bag 9013, Alexandria NSW 1435, Australia and School of Information Technologies, University of Sydney, Sydney NSW 2006, Australia;School of Computer Science and Engineering, University of New South Wales, Sydney NSW 2052, Australia;NICTA Sydney, Locked Bag 9013, Alexandria NSW 1435, Australia
Venue:
Computational Geometry: Theory and Applications
Year:
2009

Citing 9
Cited 5

Optimal point location in a monotone subdivision

SIAM Journal on Computing
Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time

WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
A foundation for representing and querying moving objects

ACM Transactions on Database Systems (TODS)
Approximation of Polygonal Curves with Minimum Number of Line Segments

ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Spatio-temporal data reduction with deterministic error bounds

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Spatio-temporal data reduction with deterministic error bounds

The VLDB Journal — The International Journal on Very Large Data Bases
Data structures for halfplane proximity queries and incremental voronoi diagrams

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Clustering vessel trajectories with alignment kernels under trajectory compression

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Abstracting and reasoning over ship trajectories and web data with the Simple Event Model (SEM)

Multimedia Tools and Applications
Machine learning for vessel trajectories using compression, alignments and domain knowledge

Expert Systems with Applications: An International Journal
A GPU approach to subtrajectory clustering using the Fréchet distance

Proceedings of the 20th International Conference on Advances in Geographic Information Systems
RFID-data compression for supporting aggregate queries

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A trajectory is a sequence of locations, each associated with a timestamp, describing the movement of a point. Trajectory data is becoming increasingly available and the size of recorded trajectories is getting larger. In this paper we study the problem of compressing planar trajectories such that the most common spatio-temporal queries can still be answered approximately after the compression has taken place. In the process, we develop an implementation of the Douglas-Peucker path-simplification algorithm which works efficiently even in the case where the polygonal path given as input is allowed to self-intersect. For a polygonal path of size n, the processing time is O(nlog^kn) for k=2 or k=3 depending on the type of simplification.