Data structures and network algorithms
Data structures and network algorithms
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Journal of Algorithms
Fréchet Distance Based Approach for Searching Online Handwritten Documents
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
Shortest Path Problems on a Polyhedral Surface
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry: Theory and Applications
Improved algorithms for partial curve matching
ESA'11 Proceedings of the 19th European conference on Algorithms
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Locally correct fréchet matchings
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
In this paper, we introduce a new generalization of the well-known Frechet distance between two polygonal curves, and provide an efficient algorithm for computing it. The classical Frechet distance between two polygonal curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-negative speeds. Here, we consider a problem instance in which the speed of traversal along each segment of the curves is restricted to be within a specified range. We provide an efficient algorithm that decides in O(n^2logn) time whether the Frechet distance with speed limits between two polygonal curves is at most @e, where n is the number of segments in the curves, and @e=0 is an input parameter. We then use our solution to this decision problem to find the exact Frechet distance with speed limits in O(n^2log^2n) time.