Compressing Spatio-temporal Trajectories

DOI10.1007/978-3-540-77120-3_66MaRDI QIDQ5387810zbMATH OpenOpenAlexFDO

Authors Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.927

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Compressing spatio-temporal trajectories
• Streaming algorithms for line simplification
• Efficient compression and indexing of trajectories
• Review on trajectory data compression
• GraCT: a grammar-based compressed index for trajectory data

Cites work

• Cartographic line simplification and polygon CSG formulae in O(n^* n) time
• Efficient algorithms for approximating polygonal chains
• scientific article; zbMATH DE number 4082817 (Why is no real title available?)
• Maintenance of configurations in the plane

Cited in

(8)

• GraCT: a grammar-based compressed index for trajectory data
• Review on trajectory data compression
• Spatio-temporal range searching over compressed kinetic sensor data
• Efficient compression and indexing of trajectories
• Finding Popular Places
• A point cloud clustering compression algorithm for spatial statistical data based on cloud computing
• Finding long and similar parts of trajectories
• Compressing spatio-temporal trajectories

This page was built for publication: Compressing Spatio-temporal Trajectories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387810)