A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation

Authors:
Banghe Li;Yuefeng Shen;Bo Li
Affiliations:
Center of Bioinformatics & Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China;Center of Bioinformatics & Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China and Graduate University of Ch ...;Center of Bioinformatics & Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, China and Graduate University of Ch ...
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 0

Computing the minimum Hausdorff distance for point sets under translation

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing the minimum Hausdorff distance between two point sets on a line under translation

Information Processing Letters
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Comparing Images Using the Hausdorff Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.89

Visualization

Abstract

To determine the similarity of two point sets is one of the major goals of pattern recognition and computer graphics. One widely studied similarity measure for point sets is the Hausdorff distance. So far, various computational methods have been proposed for computing the minimum Hausdorff distance. In this paper, we propose a new algorithm to compute the minimum Hausdorff distance between two point sets on a line under translation, which outperforms other existing algorithms in terms of efficiency despite its complexity of O((m+n)lg(m+n)), where m and n are the sizes of two point sets.