The Frechet diStance measures similCPity between two curves f and g that takes into account the ordering of the points along the two curves: Informally, it is the minimum length of a leash required to connect a dog, walking along f, and its owner, walking along g, as they walk without backtracking along their respective curves from one endpoint to the other. The discrete Frechet diStance replaces the dog and its owner by a pair of frogs that can only reside on m and n specific Stones, respectively. The Stones CPe in fact sequences of points, typically sampled from the respective curves f and g. These frogs hop from one Stone to the next without backtracking, and the discrete Frechet diStance is the minimum length of a "leash" that connects the frogs and allows them to execute such a sequence of hops from the StCPting points to the terminal points of their sequences. The discrete Frechet diStance can be computed in O(mn) time by a StraightforwCPd dynamic programming algorithm. We present the firSt subquadratic algorithm for computing the discrete Frechet diStance between two sequences of points in the plane. Assuming m ≤ n, the algorithm runs in O(mnlog log n log n ) time, in the word RAM model, using O(n) Storage. Our approach uses the geometry of the problem in a subtle way to encode legal positions of the frogs as States of a finite automaton.
- Dynamic programming acceleration
- Fréchet distance
- Similcpity of curves