Fr´echet Distance with Speed Limits ∗
An e-cient algorithm is provided that decides in O ( n 2 log n ) time whether the Fr´echet distance with speed limits between two polygonal curves is at most ε, where n is the number of segments in the curves, and ε (cid:62) 0 is an input parameter.
Anil Maheshwari, J. Sack, K. Shahbaz et al.
· 2 citations