Improved Algorithms for Partial Curve Matching

We revisit the problem of deciding whether a given curve resembles some part of a larger curve under a fixed Fréchet distance, achieving a running time of O(nm), for n and m being the number of segments in the two curves. This improves the long-standing result of Alt and Godau by an O(log(nm)) factor. Our solution is based on constructing a simple data structure which we call free-space map. Using this data structure, we obtain improved algorithms for several variants of the Fréchet distance problem, including the Fréchet distance between two closed curves, and the so-called minimum/maximum walk problems. We also improve the map matching algorithm of Alt et al. for the particular case in which the map is a directed acyclic graph.

[1]  Jörg-Rüdiger Sack,et al.  Fréchet distance with speed limits , 2011, Comput. Geom..

[2]  Hamid Zarrabi-Zadeh,et al.  Staying Close to a Curve , 2011, CCCG.

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

[4]  Joachim Gudmundsson,et al.  Constrained free space diagrams: a tool for trajectory analysis , 2010, Int. J. Geogr. Inf. Sci..

[5]  G. Rote,et al.  How Difficult is it to Walk the Dog ? , 2007 .

[6]  Kevin Buchin,et al.  Exact algorithms for partial curve matching via the Fréchet distance , 2009, SODA.

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

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

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

[10]  Susanne Albers,et al.  Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday , 2009, Efficient Algorithms.

[11]  Alexander Wolff,et al.  Computing large matchings fast , 2008, SODA '08.

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

[13]  Chiranjib Bhattacharyya,et al.  Fréchet Distance Based Approach for Searching Online Handwritten Documents , 2007 .

[14]  Helmut Alt,et al.  The Computational Geometry of Comparing Shapes , 2009, Efficient Algorithms.

[15]  Sariel Har-Peled,et al.  The fréchet distance revisited and extended , 2012, TALG.