Hausdorff distance

(definition)

Definition: A measure of the resemblance of two (fixed) sets of geometric points P and Q, defined as H(P,Q)=max{max_{a∈ P} min_{b∈ Q} d(a,b), max_{a∈ Q} min_{b∈ P} d(a,b)} where d(·,·) is the distance metric, usually the Euclidean distance.

Note: Adapted from [AS98, page 437].

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:
Paul E. Black, "Hausdorff distance", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/hausdorffdst.html