Compressing spatio-temporal trajectories

DOI10.1016/J.COMGEO.2009.02.002MaRDI QIDQ833705zbMATH OpenOpenAlexFDO

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

Publication date 14 August 2009

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2009.02.002

zbMATH Keywords

path simplificationpolygonal-chain approximationtrajectory compression

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Compressing Spatio-temporal Trajectories
• Progressive simplification of polygonal curves
• Streaming algorithms for line simplification
• Streaming algorithms for line simplification
• On optimal polyline simplification using the Hausdorff and Fréchet distance

Cites work

• scientific article; zbMATH DE number 4082817 (Why is no real title available?)
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• An efficient algorithm for determining the convex hull of a finite planar set
• Another efficient algorithm for convex hulls in two dimensions
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Efficient algorithms for approximating polygonal chains
• Maintenance of configurations in the plane
• Optimal Point Location in a Monotone Subdivision

Cited in

(6)

• Compressing Spatio-temporal Trajectories
• GraCT: a grammar-based compressed index for trajectory data
• Improved algorithm for vector data compression based on dynamic programming
• Review on trajectory data compression
• Straight-path queries in trajectory data
• Efficient compression and indexing of 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 Q833705)