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.
Unable to display preview. Download preview PDF.
- 2.Alt, H., Guibas, L.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey. In: Handbook on Computational Geometry, pp. 251–265 (1995)Google Scholar
- 3.Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proc. 20th Ann. ACM Symp. on Theory of Comp., pp. 434–444 (1988)Google Scholar
- 5.Goodrich, M.T., Mitchell, J.S.B., Orletsky, M.W.: Practical methods for approximate geometric pattern matching under rigid motion. In: Proc. 10th Annu. ACM Sympos. Comput. Geom, pp. 103–112 (1994)Google Scholar
- 7.Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th Annu. ACM Sympos. Comput. Geom, pp. 208–217 (1989)Google Scholar
- 9.Knauer, C., Löffler, M., Scherfenberg, M., Wolle, T.: The directed Hausdorff distance between imprecise point sets (Preprint, 2009), http://arXiv.org/abs/0909.4642
- 13.Nagai, T., Tokura, N.: Tight Error Bounds of Geometric Problems on Convex Objects with Imprecise Coordinates. In: Japanese Conference on Discrete and Computational Geometry, pp. 252–263 (2000)Google Scholar