What is it about?
We unify Discrete Frechet Distance and Dynamic Time-Warping, in order to measure similarity of polygonal lines, or discrete curves. We propose improved algorithms for similarity computation. Moreover, our novel methods offer a trade-off between time and space complexity.
Featured Image
Photo by Ludovic Charlet on Unsplash
Why is it important?
A famous concrete example is to minimize the leash when walking your dog. Discrete curves are important in time-series analytics, comparison of trajectories in 2D and 3D, as well as computing the distance of one-dimensional structures such as molecular backbones.
Perspectives
Read the Original
This page is a summary of: Products of Euclidean Metrics, Applied to Proximity Problems among Curves, ACM Transactions on Spatial Algorithms and Systems, August 2020, ACM (Association for Computing Machinery),
DOI: 10.1145/3397518.
You can read the full text:
Contributors
The following have contributed to this page