A metric on the nonempty compact subsets of a metric space defined by the smallest epsilon such that each set is contained in the epsilon-neighborhood of the other; equivalently the maximum of the two directed set-to-set distances.

Principle

It measures the largest minimal distance between points of two sets, providing a uniform notion of closeness for shapes; convergence in Hausdorff distance means uniform convergence of sets in the ambient metric.

Demonstration

For two line segments in R^2 that are parallel and offset by distance d, the Hausdorff distance equals d; for nested shapes, the distance records the maximal outward displacement required to cover one by the other.

Misapplication

Applying Hausdorff distance blindly to non-compact or unbounded sets without modification (it may be infinite), or expecting it to reflect volumetric or measure-theoretic similarity.

Consequence

The space of nonempty compact subsets of a complete metric space is itself a complete metric space under Hausdorff distance; it gives a topology used in shape comparison, attractor convergence, and geometric limit arguments.

Reversal

Other set distances (e.g., symmetric difference measure or Wasserstein distances) capture different features such as measure discrepancy or mass transportation cost and can disagree with Hausdorff closeness.

Boundary

Standardly defined for nonempty compact subsets of a metric space; extensions to closed or unbounded sets require modifications (e.g., bounded-Hausdorff metric) and may lose compactness properties.

Semantic Tension

Tension with measure-based distances and with topologies like the Vietoris or Fell topology; Hausdorff emphasizes boundary and worst-case gaps rather than average or probabilistic differences.

Synthesis

The Hausdorff distance is the supremal nearest-neighbor mismatch between compact sets in a metric space, giving a uniform, worst-case metric for the closeness of shapes.