SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension

We show by reduction from the Orthogonal Vectors problem that algorithms with strongly subquadratic running time cannot approximate the Frechet distance between curves better than a factor 3 unless SETH fails. We show that similar reductions cannot achieve a lower bound with a factor better than 3. Our lower bound holds for the continuous, the discrete, and the weak discrete Frechet distance even for curves in one dimension. Interestingly, the continuous weak Frechet distance behaves differently. Our lower bound still holds for curves in two dimensions and higher. However, for curves in one dimension, we provide an exact algorithm to compute the weak Frechet distance in linear time.

[1]  Ryan Williams.  A new algorithm for optimal constraint satisfaction and its implications , 2004, Electron. Colloquium Comput. Complex..

[2]  Karl Bringmann,et al.  More consequences of falsifying SETH and the orthogonal vectors conjecture , 2018, STOC.

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

[4]  Marvin Künnemann,et al.  Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds , 2014, Int. J. Comput. Geom. Appl..

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

[6]  Karl Bringmann,et al.  Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[7]  Frank Staals,et al.  Clustering Trajectories for Map Construction , 2017, SIGSPATIAL/GIS.

[8]  Wolfgang Mulzer,et al.  Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance , 2012, Discret. Comput. Geom..

[9]  Daniel M. Kane,et al.  The Orthogonal Vectors Conjecture for Branching Programs and Formulas , 2017, ITCS.

[10]  Wolfgang Mulzer,et al.  Approximability of the discrete Fréchet distance , 2016, J. Comput. Geom..

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

[12]  Maarten Löffler,et al.  Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution) , 2017, Symposium on Computational Geometry.

[13]  Kevin Buchin,et al.  Visual analytics of delays and interaction in movement data , 2017, Int. J. Geogr. Inf. Sci..

[14]  Haim Kaplan,et al.  Computing the Discrete Fréchet Distance in Subquadratic Time , 2013, SODA.

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

[16]  Christian Sohler,et al.  Clustering time series under the Fréchet distance , 2015, SODA.

[17]  Amir Nayyeri,et al.  On Computing the Fréchet Distance Between Surfaces , 2016, Symposium on Computational Geometry.

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

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

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

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

[22]  H. Mannila,et al.  Computing Discrete Fréchet Distance ∗ , 1994 .

[23]  Bettina Speckmann,et al.  Computing the Similarity Between Moving Curves , 2015, ESA.

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

[25]  Kevin Buchin,et al.  Fréchet Distance of Surfaces: Some Simple Hard Cases , 2010, ESA.

[26]  Joachim Gudmundsson,et al.  Towards Automated Football Analysis: Algorithms and Data Structures , 2010 .

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