Compressing spatio-temporal trajectories

DOI10.1016/j.comgeo.2009.02.002zbMath1181.65032OpenAlexW2153249319MaRDI QIDQ833705

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

zbMATH Keywords

path simplificationpolygonal-chain approximationtrajectory compression

Mathematics Subject Classification ID

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

Cites Work

• 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
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Data structures for halfplane proximity queries and incremental Voronoi diagrams
• Efficient algorithms for approximating polygonal chains
• An efficient algorithm for determining the convex hull of a finite planar set
• Optimal Point Location in a Monotone Subdivision
• Unnamed Item