Design of Dynamic Data Structures
Design of Dynamic Data Structures
Scaling up Dynamic Time Warping to Massive Dataset
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Journal of Algorithms
An effective and efficient algorithm for high-dimensional outlier detection
The VLDB Journal — The International Journal on Very Large Data Bases
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
SIAM Journal on Computing
Optimization of subsequence matching under time warping in time-series databases
Proceedings of the 2005 ACM symposium on Applied computing
On map-matching vehicle tracking data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Addressing the Need for Map-Matching Speed: Localizing Globalb Curve-Matching Algorithms
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
Improved Bounds on the Union Complexity of Fat Objects
Discrete & Computational Geometry
Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Exact algorithms for partial curve matching via the Fréchet distance
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Detecting Commuting Patterns by Clustering Subtrajectories
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The Computational Geometry of Comparing Shapes
Efficient Algorithms
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
Fréchet distance with speed limits
Computational Geometry: Theory and Applications
The frechet distance revisited and extended
Proceedings of the twenty-seventh annual symposium on Computational geometry
Geometric Approximation Algorithms
Geometric Approximation Algorithms
Chroma Binary Similarity and Local Alignment Applied to Cover Song Identification
IEEE Transactions on Audio, Speech, and Language Processing
Computational Geometry: Theory and Applications
Measuring similarity between curves on 2-manifolds via homotopy area
Proceedings of the twenty-ninth annual symposium on Computational geometry
Similarity of polygonal curves in the presence of outliers
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
The similarity of two polygonal curves can be measured using the Fréchet distance. We introduce the notion of a more robust Fréchet distance, where one is allowed to shortcut between vertices of one of the curves. This is a natural approach for handling noise, in particular batched outliers. We compute a constant factor approximation to the minimum Fréchet distance over all possible such shortcuts. Our algorithm runs in O(c2 kn log3 n) time if one is allowed to take at most k shortcuts and the input curves are c-packed. For the case where the number of shortcuts is unrestricted, we describe an algorithm which runs in O(c2 n log3 n) time. To facilitate the new algorithm we develop several new data-structures, which we believe to be of independent interest: (i) for range reporting on a curve, and (ii) for preprocessing a curve to answer queries for the Fréchet distance between a subcurve and a line segment.