Hausdorff distance
Encyclopedia : H : HA : HAU : Hausdorff distance
The Hausdorff distance, or Hausdorff metric, measures how far two compact non-empty subsets of a metric space are from each other. It is named after Felix Hausdorff.
Definitions
Let X and Y be two compact subsets of a metric space M. Then Hausdorff distance dH(X,Y) is the minimal number r such that the closed r-neighborhood of X contains Y and the closed r-neighborhood of Y contains X. In other words, if d(x, y) denotes the distance in M, then
- [ d_(X,Y) = \max\ \inf_ d(x,y),\, \sup_ \inf_ d(x,y)\,\}\mbox \! ]
Hausdorff distance can be defined the same way for closed not-necessarily-compact subsets of M, but in this case the distance may take infinite values, and the topology of F(M) starts to depend on particular metric on M (not only on its topology). The Hausdorff distance between not-necessarily-closed subsets can be defined as the Hausdorff distance between their closures. It gives a pre-metric (or pseudometric) on the set of all subsets of M (the Hausdorff distance between any two sets with the same closure is zero).
In Euclidean geometry, one often uses an analog, Hausdorff distance up to isometry. Namely, let X and Y be two compact figures in a Euclidean space; then DH(X,Y) is the minimum of dH(I(X),Y) along all isometries I of Euclidean space. This distance measures how far X and Y are from being isometric.
See also
- Gromov-Hausdorff convergence
- http://planetmath.org/encyclopedia/HausdorffMetric.html
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
