Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation

Discrete and Computational Geometry

Volumn 16, Issue 2, 1996, Pages 135-153

  Rucklidge, W J ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030500847     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02716804     Document Type: Article

References (7)

1. 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.
2. H. Alt, B. Behrends, and J. Blömer. Approximate matching of polygonal shapes. Discrete and Computational Geometry, 9:267-291, 1993.
3. 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.
4. 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.
5. 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.
6. D. P. Huttenlocher and W. J. Rucklidge. A multi-resolution technique for comparing images using the Hausdorff distance. Proc. Computer Vision and Pattern Recognition Conference, pages 705-706, New York, 1993.
7. 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.