Computing the Fréchet distance between simple polygons in polynomial time
Kevin Buchin, Maike Buchin, Carola Wenk · 2006
We present the first polynomial-time algorithm for computing the Fréchet for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.