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

DOI10.1007/BF02716804zbMath0853.68111MaRDI QIDQ1923771

W. J. Rucklidge

Publication date: 2 January 1997

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

complexityHausdorff distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions ⋮ Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions ⋮ Geometric pattern matching under Euclidean motion ⋮ Geometric pattern matching for point sets in the plane under similarity transformations

Cites Work

• Geometric pattern matching under Euclidean motion
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• The upper envelope of Voronoi surfaces and its applications
• Improvements on geometric pattern matching problems
• Unnamed Item

This page was built for publication: Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation