The Directed Hausdorff Distance between Imprecise Point Sets

We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an imprecise point may be anywhere within its disc. Due to the direction of the Hausdorff Distance and whether its tight upper or lower bound is computed there are several cases to consider. For every case we either show that the computation is NP-hard or we present an algorithm with a polynomial running time. Further we give several approximation algorithms for the hard cases and show that one of them cannot be approximated better than with factor 3, unless P=NP.

[1]  Asish Mukhopadhyay,et al.  On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area , 2007, ICCSA.

[2]  Maarten Löffler,et al.  Optimization for First Order Delaunay Triangulations , 2007, WADS.

[3]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[4]  Helmut Alt,et al.  Approximate matching of polygonal shapes , 1995, SCG '91.

[5]  H. Alt.  Discrete Geometric Shapes Matching Interpolation and Approximation A Survey , 2009 .

[6]  Maarten Löffler,et al.  Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points , 2007, WADS.

[7]  Michael T. Goodrich,et al.  Stabbing Parallel Segments with a Convex Polygon , 1990, Comput. Vis. Graph. Image Process..

[8]  Stefan Schirra,et al.  Approximate Decision Algorithms for Point Set Congruence , 1994, Comput. Geom..

[9]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[10]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[11]  Joseph S. B. Mitchell,et al.  Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version) , 1994, SCG '94.

[12]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[13]  Leonidas J. Guibas,et al.  Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.

[14]  Asish Mukhopadhyay,et al.  On intersecting a set of parallel line segments with a convex polygon of minimum area , 2008, Inf. Process. Lett..

[15]  Takayuki Nagai,et al.  Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates , 2000, JCDCG.