COMPUTING THE HAUSDORFF DISTANCE BETWEEN TWO SETS OF PARAMETRIC CURVES

Title & Authors
COMPUTING THE HAUSDORFF DISTANCE BETWEEN TWO SETS OF PARAMETRIC CURVES
Kim, Ik-Sung; McLean, William;

Abstract
We present an algorithm for computing the Hausdorff distance between two parametric curves in $\small{\mathbb{R}^n}$, or more generally between two sets of parametric curves in $\small{\mathbb{R}^n}$. During repeated subdivision of the parameter space, we prune subintervals that cannot contain an optimal point. Typically, our algorithm costs O(logM) operations, compared with O(M) operations for a direct, brute-force method, to achieve an accuracy of $\small{O(M^{-1})}$.
Keywords
Hausdorff distance;pruning technique;
Language
English
Cited by
References
1.
H. Alt, P. Brass, M. Godau, C. Knauer, and C.Wenk, Computing the Hausdorff distance of geometric patterns and shapes, Discrete and computational geometry, 65-76, Algorithms Combin., 25, Springer, Berlin, 2003.

2.
E. Belogay, C. Cabrelli, U. Molter, and R. Shankwiler, Calculating the Hausdorff distance between curves, Inform. Process. Lett. 64 (1997), no. 1, 17-22.

3.
M. Bouts, Comparing images using the Hausdorff distance, unpublished manuscript, 2006.

4.
R. P. Brent, Algorithms for Minimization without Derivatives, Prentice-Hall, 1973.

5.
G. Rote, Computing the minimum Hausdorff distance between two point sets on a line under translation, Inform. Process. Lett. 38 (1991), no. 3, 123-127.

6.
L. Scharf, Computing the Hausdorff distance between sets of curves, Thesis, Freie Universitat, Berlin, 2003.