Computing the Discrete FRéChet Distance with Imprecise Input

We consider the problem of computing the discrete Frechet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2O(d2) m2n2log2(mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the planar case with running time O(mn log3(mn) + (m2+n2) log (mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L∞ distance, we give an O(dmn log(dmn))-time algorithm. We also give efficient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in "realistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size).

[1]  Martin E. Dyer,et al.  A class of convex programs with applications to computational geometry , 1992, SCG '92.

[2]  Maarten Löffler,et al.  Delaunay triangulation of imprecise points in linear time after preprocessing , 2010, Comput. Geom..

[3]  Alistair Moffat,et al.  Compression and Coding Algorithms , 2005, IEEE Trans. Inf. Theory.

[4]  Maarten Löffler,et al.  The directed Hausdorff distance between imprecise point sets , 2011, Theor. Comput. Sci..

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

[6]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

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

[8]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

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

[10]  Helmut Alt,et al.  Matching Polygonal Curves with Respect to the Fréchet Distance , 2001, STACS.

[11]  Maarten Löffler,et al.  Largest and Smallest Tours and Convex Hulls for Imprecise Points , 2006, SWAT.

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

[13]  Jürgen Dorn,et al.  Vienna, Austria: The Christian Doppler Laboratory for Expert Systems , 1992 .

[14]  William S. Evans,et al.  Guaranteed Voronoi Diagrams of Uncertain Sites , 2008, CCCG.

[15]  Abbas Edalat,et al.  Computing Delaunay Triangulation with Imprecise Input Data , 2003, CCCG.

[16]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[17]  Günter Rote.  Computing the Fréchet distance between piecewise smooth curves , 2007, Comput. Geom..

[18]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[19]  Micha Sharir,et al.  Efficient algorithms for geometric optimization , 1998, CSUR.