Finding long and similar parts of trajectories

DOI10.1016/j.comgeo.2011.05.004zbMath1231.65039OpenAlexW2042968733MaRDI QIDQ654283

Jun Luo, Maike Buchin, Kevin Buchin, Marc J. van Kreveld

Publication date: 28 December 2011

Published in: Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

similarity measuremoving objectstrajectory analysis

Mathematics Subject Classification ID

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

Cites Work

• Efficiently approximating polygonal paths in three and higher dimensions
• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
• An Optimal Algorithm for the Maximum-Density Segment Problem
• Compressing Spatio-temporal Trajectories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding long and similar parts of trajectories