Compressing spatio-temporal trajectories

DOI10.1016/J.COMGEO.2009.02.002zbMATH Open1181.65032OpenAlexW2153249319MaRDI QIDQ833705FDOQ833705

Jyrki Katajainen, Damian Merrick, Cahya Ong, Joachim Gudmundsson, 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

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

zbMATH Keywords

path simplificationpolygonal-chain approximationtrajectory compression

Mathematics Subject Classification ID

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

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Another efficient algorithm for convex hulls in two dimensions
• Maintenance of configurations in the plane
• Optimal Point Location in a Monotone Subdivision
• Efficient algorithms for approximating polygonal chains
• Title not available (Why is that?)
• Data structures for halfplane proximity queries and incremental Voronoi diagrams
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time

Cited In (2)

• Compressing Spatio-temporal Trajectories
• Improved algorithm for vector data compression based on dynamic programming

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)