Computing the Fréchet distance between piecewise smooth curves (Q883235)

Considering two polygonal curves, \textit{H. Alt} and \textit{M. Godau} [Int. J. Comput. Geom. Appl. 5, No. 1--2, 75--91 (1995; Zbl 0941.68809)] initiated the study of Fréchet distance from a computational point of view. Considering here a more general type of curves, the author shows that the number of steps for solving the decision problem is not larger than for the polygonal paths. It is further shown that under stronger conditions on the curves the optimization problem can be solved in a time which matches the running time for the polygonal case.