论文信息 - Computing the Fréchet distance between piecewise smooth curves

Computing the Fréchet distance between piecewise smooth curves

We consider the Frechet distance between two curves which are given as a sequence of m+n curved pieces. If these pieces are sufficiently well-behaved, we can compute the Frechet distance in O(mnlog(mn)) time. The decision version of the problem can be solved in O(mn) time. The results are based on an analysis of the possible intersection patterns between circles and arcs of bounded curvature.

Günter Rote

[1] Günter Rote,et al. Matching planar maps , 2003, SODA '03.

[2] Oscar Gonzalez,et al. Curves, circles, and spheres , 2002 .

[3] Richard Cokt. Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms , 1984 .

[4] Helmut Alt,et al. Matching Polygonal Curves with Respect to the Fréchet Distance , 2001, STACS.

[5] Martin Held,et al. Voronoi diagrams and offset curves of curvilinear polygons , 1998, Comput. Aided Des..

[6] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7] Helmut Alt,et al. Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[8] Rida T. Farouki,et al. Analytic properties of plane offset curves , 1990, Comput. Aided Geom. Des..