Compressing spatio-temporal trajectories

Authors:
Joachim Gudmundsson;Jyrki Katajainen;Damian Merrick;Cahya Ong;Thomas Wolle
Affiliations:
NICTA, Sydney, Australia;Department of Computing, University of Copenhagen, Denmark;NICTA, Sydney, Australia and School of Information Technologies, University of Sydney, Australia;Department of Engineering, University of New South Wales, Australia;NICTA, Sydney, Australia
Venue:
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Year:
2007

Citing 7
Cited 9

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
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

Finding long and similar parts of trajectories

Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Finding popular places

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Clustering of trajectories in video surveillance using growing neural gas

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Finding long and similar parts of trajectories

Computational Geometry: Theory and Applications
Efficient real-time trajectory tracking

The VLDB Journal — The International Journal on Very Large Data Bases
A two-layer approach for energy efficiency in mobile location sensing applications

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Effectively grouping trajectory streams

NFMCP'12 Proceedings of the First international conference on New Frontiers in Mining Complex Patterns
Direction-preserving trajectory simplification

Proceedings of the VLDB Endowment
Dealing with trajectory streams by clustering and mathematical transforms

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectories such that the most common queries can still be answered approximately after the compression step has taken place. In the process we develop an O(n logk n)-time implementation of the Douglas-Peucker algorithm in the case when the polygonal path of n vertices given as input is allowed to self-intersect.