Computing the Fréchet Distance between Real-Valued Surfaces

The Frechet distance is a well-studied measure for the similarity of shapes. While efficient algorithms for computing the Frechet distance between curves exist, there are only few results on the Frechet distance between surfaces. Recent work has shown that the Frechet distance is computable between piecewise linear functions f and g: M → ℝk with M a triangulated surface of genus zero. We focus on the case k = 1 and M being a topological sphere or disk with constant boundary. Intuitively, we measure the distance between terrains based solely on the height function. Our main result is that in this case computing the Frechet distance between f and g is in NP. We additionally show that already for k = 1, computing a factor 2 − e approximation of the Frechet distance is NP-hard, showing that this problem is in fact NP-complete. We also define an intermediate distance, between contour trees, which we also show to be NP-complete to compute. Finally, we discuss how our and other distance measures between contour trees relate to each other.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  M. Fréchet.  Sur la distance de deux surfaces , .

[3]  Ulrich Bauer,et al.  Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs , 2014, SoCG.

[4]  Wolfgang Mulzer,et al.  Computing the Fréchet Distance with a Retractable Leash , 2016, Discret. Comput. Geom..

[5]  Daniel Keysers,et al.  Elastic image matching is NP-complete , 2003, Pattern Recognit. Lett..

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

[7]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[8]  Ulrich Bauer,et al.  Measuring Distance between Reeb Graphs , 2013, SoCG.

[9]  Valerio Pascucci,et al.  Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.

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

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

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

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

[14]  H. Hahn.  Sur quelques points du calcul fonctionnel , 1908 .

[15]  M. Buchin.  On the Computability of the Frechet Distance Between Triangulated Surfaces , 2007 .

[16]  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.

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

[18]  L. Babai,et al.  Algorithms for simple curves on surfaces, string graphs, and crossing numbers , 2005 .

[19]  Bernd Hamann,et al.  Measuring the Distance Between Merge Trees , 2014, Topological Methods in Data Analysis and Visualization.

[20]  Haim Kaplan,et al.  Computing the Discrete Fréchet Distance in Subquadratic Time , 2012, SIAM J. Comput..

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

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

[23]  Marcus Schaefer,et al.  Recognizing string graphs in NP , 2002, STOC '02.

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

[25]  Gunther H. Weber,et al.  Interleaving Distance between Merge Trees , 2013 .

[26]  Kevin Buchin,et al.  Computing the Fréchet distance between simple polygons , 2008, Comput. Geom..

[27]  Carola Wenk,et al.  Computing the Fréchet distance between folded polygons , 2015, Comput. Geom..

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

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  Kyle Fox,et al.  Computing the Gromov-Hausdorff Distance for Metric Trees , 2015, ISAAC.

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

[32]  Claudia Landi,et al.  The Edit Distance for Reeb Graphs of Surfaces , 2014, Discret. Comput. Geom..

[33]  Max J. Egenhofer,et al.  Reasoning about Binary Topological Relations , 1991, SSD.

[34]  Amir Nayyeri,et al.  Computing the Fréchet Distance Between Polygons with Holes , 2015, ICALP.

[35]  Marcus Schaefer,et al.  Decidability of string graphs , 2001, STOC '01.

[36]  Nikos Paragios,et al.  Deformable Medical Image Registration: A Survey , 2013, IEEE Transactions on Medical Imaging.