Abstract
The Hausdorff distance is a measure defined between two sets in some metric space. This paper investigates how the Hausdorff distance changes as one set is transformed by some transformation group. Algorithms to find the minimum distance as one set is transformed have been described, but few lower bounds are known. We consider the complexity of the graph of the Hausdorff distance as a function of transformation, and exhibit some constructions that give lower bounds for this complexity. We exhibit lower-bound constructions for both sets of points in the plane, and sets of points and line segments; we consider the graph of the directed Hausdorff distance under translation, rigid motion, translation and scaling, and affine transformation. Many of the results can also be extended to the undirected Hausdorff distance. These lower bounds are for the complexity of the graph of the Hausdorff distance, and thus do not necessarily bound algorithms that search this graph; however, they do give an indication of how complex the search may be.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization.Proc. Third ACM-SIAM Symposium on Discrete Algorithms, pages 72–82, 1992.
H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes.Discrete and Computational Geometry, 9:267–291, 1993.
L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion.Proc. Fifth Canadian Conference on Computational Geometry, pages 151–156, Waterloo, Ontario, August 1993.
L. P. Chew and K. Kedem. Improvements on approximate pattern matching problems. In O. Nurmi and E. Ukkonen, editors,Proc. Third Scandinavian Workshop on Algorithm Theory, pages 318–325. Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992.
D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications.Discrete and Computational Geometry, 9(3):267–291, 1993.
D. P. Huttenlocher and W. J. Rucklidge. A multi-resolution technique for comparing images using the Hausdorff distanceProc. Computer Vision and Pattern Recognition Conference, pages 705–706, New York, 1993.
G. Rote. Computing the minimum Hausdorff distance between two point sets on a line under translation.Information Processing Letters, 38(3):123–127, May 1991.
Author information
Authors and Affiliations
Additional information
This work was supported in part by National Science Foundation PYI Grant IRI-9057928 and matching funds from General Electric, Kodak, and Xerox, and in part by Air Force Contract AFOSR-91-0328.
Rights and permissions
About this article
Cite this article
Rucklidge, W.J. Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation. Discrete Comput Geom 16, 135–153 (1996). https://doi.org/10.1007/BF02716804
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02716804