Simplification of trajectory streams
From MaRDI portal
Cites work
- A Fast O(N) Multiresolution Polygonal Approximation Algorithm for GPS Trajectory Simplification
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Clustering time series under the Fréchet distance
- Curve simplification and clustering under Fréchet distance
- Data streams: algorithms and applications.
- Global Curve Simplification
- scientific article; zbMATH DE number 176499 (Why is no real title available?)
- Near-linear time approximation algorithms for curve simplification
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Polyline simplification has cubic complexity
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Solving Fréchet distance problems by algebraic geometric methods
- Static and streaming data structures for Fréchet distance queries
- Streaming algorithms for line simplification
- Streaming algorithms for line simplification
This page was built for publication: Simplification of trajectory streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312680)