Finding long and similar parts of trajectories
From MaRDI portal
Publication:654283
DOI10.1016/J.COMGEO.2011.05.004zbMATH Open1231.65039OpenAlexW2042968733MaRDI QIDQ654283FDOQ654283
Authors: Kevin Buchin, Maike Buchin, Jun Luo, Marc 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
Recommendations
Cites Work
- Detecting commuting patterns by clustering subtrajectories
- 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.
- A geometric framework for solving subsequence problems in computational biology efficiently
- An Optimal Algorithm for the Maximum-Density Segment Problem
- Efficiently approximating polygonal paths in three and higher dimensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressing Spatio-temporal Trajectories
Cited In (7)
- Finding structurally and temporally similar trajectories in graphs
- An effective and versatile distance measure for spatiotemporal trajectories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate hotspots of orthogonal trajectories
- Detecting commuting patterns by clustering subtrajectories
- Median trajectories
This page was built for publication: Finding long and similar parts of trajectories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654283)
