Approximating the Fréchet Distance for Realistic Curves in Near Linear Time

We present a simple and practical (1+ε)-approximation algorithm for the Fréchet distance between polygonal curves. To analyze this algorithm we introduce a new realistic family of curves, c-packed curves, that is closed under simplification. We believe the notion of c-packed curves to be of independent interest. We show that our algorithm has near linear running time for c-packed polygonal curves, and show similar results for other input models, such as low density.

[1]  S. Rao Kosaraju,et al.  A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields , 1995, JACM.

[2]  Jeff Erickson,et al.  On the relative complexities of some geometric problems , 1995, CCCG.

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

[4]  Mark de Berg,et al.  Realistic input models for geometric algorithms , 1997, SCG '97.

[5]  Kim-Fung Man,et al.  Parallel Genetic-Based Hybrid Pattern Matching Algorithm for Isolated Word Recognition , 1998, Int. J. Pattern Recognit. Artif. Intell..

[6]  Pietro Perona,et al.  Continuous dynamic time warping for translation-invariant curve alignment with applications to signature verification , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[7]  Alon Efrat,et al.  The complexity of the union of (α, β)-covered objects , 1999, SCG '99.

[8]  Eamonn J. Keogh,et al.  Scaling up Dynamic Time Warping to Massive Dataset , 1999, PKDD.

[9]  M. Godau.  On the complexity of measuring the similarity between geometric objects in higher dimensions , 1999 .

[10]  Mark de Berg,et al.  Linear Size Binary Space Partitions for Uncluttered Scenes , 2000, Algorithmica.

[11]  Helmut Alt,et al.  Comparison of Distance Measures for Planar Curves , 2003, Algorithmica.

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

[13]  Sang-Wook Kim,et al.  Optimization of subsequence matching under time warping in time-series databases , 2005, SAC '05.

[14]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[15]  Nabil H. Mustafa,et al.  Near-Linear Time Approximation Algorithms for Curve Simplification , 2005, Algorithmica.

[16]  Alon Efrat.  The Complexity of the Union of (alpha, beta)-Covered Objects , 2005, SIAM J. Comput..

[17]  Dieter Pfoser,et al.  On Map-Matching Vehicle Tracking Data , 2005, VLDB.

[18]  Dieter Pfoser,et al.  Addressing the Need for Map-Matching Speed: Localizing Global Curve-Matching Algorithms , 2006, 18th International Conference on Scientific and Statistical Database Management (SSDBM'06).

[19]  Boris Aronov,et al.  Fréchet Distance for Curves, Revisited , 2006, ESA.

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

[21]  How Difficult is it to Walk the Dog ? , 2007 .

[22]  Mark de Berg.  Improved Bounds on the Union Complexity of Fat Objects , 2008, Discret. Comput. Geom..

[23]  Joachim Gudmundsson,et al.  Detecting single file movement , 2008, GIS '08.

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

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

[26]  Maike Buchin,et al.  Can We Compute the Similarity between Surfaces? , 2007, Discret. Comput. Geom..

[27]  Prosenjit Bose,et al.  A note on the perimeter of fat objects , 2011, Comput. Geom..

[28]  Joachim Gudmundsson,et al.  Detecting Commuting Patterns by Clustering Subtrajectories , 2011, Int. J. Comput. Geom. Appl..

[29]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2012, Discret. Comput. Geom..