Fréchet distance with speed limits

In this paper, we introduce a new generalization of the well-known Frechet distance between two polygonal curves, and provide an efficient algorithm for computing it. The classical Frechet distance between two polygonal curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-negative speeds. Here, we consider a problem instance in which the speed of traversal along each segment of the curves is restricted to be within a specified range. We provide an efficient algorithm that decides in O(n^2logn) time whether the Frechet distance with speed limits between two polygonal curves is at most @e, where n is the number of segments in the curves, and @e>=0 is an input parameter. We then use our solution to this decision problem to find the exact Frechet distance with speed limits in O(n^2log^2n) time.

[1]  Erin W. Chambers,et al.  Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time , 2010, Comput. Geom..

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

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

[4]  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).

[5]  Anil Maheshwari,et al.  On computing Fréchet distance of two paths on a convex polyhedron , 2005, EuroCG.

[6]  Atlas F. Cook,et al.  Shortest Path Problems on a Polyhedral Surface , 2009, Algorithmica.

[7]  Atlas F. Cook,et al.  Geodesic Fréchet distance inside a simple polygon , 2008, TALG.

[8]  Atlas F. Cook,et al.  Geodesic Fréchet distance inside a simple polygon , 2010, TALG.

[9]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[10]  Leonidas J. Guibas,et al.  New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping , 2002, Discret. Comput. Geom..

[11]  Chiranjib Bhattacharyya,et al.  Fréchet Distance Based Approach for Searching Online Handwritten Documents , 2007, Ninth International Conference on Document Analysis and Recognition (ICDAR 2007).

[12]  Binhai Zhu,et al.  Protein Structure-structure Alignment with Discrete FrÉchet Distance , 2008, J. Bioinform. Comput. Biol..

[13]  Atlas F. Cook,et al.  Shortest Path Problems on a Polyhedral Surface , 2012, Algorithmica.

[14]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.