Computing the Fréchet distance with shortcuts is NP-hard

We study the shortcut Fréchet distance, a natural variant of the Fréchet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Fréchet distance is a bottle-neck distance measure and hence quite sensitive to outliers. The shortcut Fréchet distance allows us to cut across outliers and hence produces more meaningful results when dealing with real world data. Driemel and Har-Peled recently described approximation algorithms for the restricted case where shortcuts have to start and end at input vertices. We show that, in the general case, the problem of computing the shortcut Fréchet distance is NP-hard. This is the first hardness result for a variant of the Fréchet distance between two polygonal curves in the plane. We also present two algorithms for the decision problem: a 3-approximation algorithm for the general case and an exact algorithm for the vertex-restricted case. Both algorithms run in O(n3 log n) time.

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

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

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

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

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

[6]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[7]  Anne Driemel,et al.  Realistic Analysis for Algorithmic Problems on Geographical Data , 2013 .

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

[9]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2010, Discrete & Computational Geometry.

[10]  Thomas Devogele,et al.  Coastline Matching Process Based on the Discrete Fréchet Distance , 2006 .

[11]  Jörg-Rüdiger Sack,et al.  Similarity of polygonal curves in the presence of outliers , 2014, Comput. Geom..

[12]  Sariel Har-Peled,et al.  Jaywalking your dog: computing the Fréchet distance with shortcuts , 2011, SODA 2012.

[13]  Binhai Zhu,et al.  A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance , 2012, ISBRA.

[14]  Haim Kaplan,et al.  The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection , 2014, Symposium on Computational Geometry.

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

[16]  Sergey Bereg,et al.  Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance , 2008, LATIN.

[17]  Sariel Har-Peled,et al.  Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts , 2012, SIAM J. Comput..

[18]  Mark de Berg,et al.  Approximate range searching using binary space partitions , 2006, Comput. Geom..

[19]  Wolfgang Mulzer,et al.  Four Soviets Walk the Dog - with an Application to Alt's Conjecture , 2012, SODA.