# Computational Aspects of the Hausdorff Distance in Unbounded Dimension

Source: [Computational Aspects of the Hausdorff Distance in Unbounded Dimension](<https://www.sota2.com/research/paper/68fa50a41e209131ce96d5a3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T10:59:31.552Z

Authors: Stefan K\\"onig

Published: 2014-01-07T16:37:02.000Z

## Abstract

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed to be homothetically transformed in order to minimize its Hausdorff distance to another one. For this problem, we characterize optimal solutions, deduce a Helly-type theorem and give polynomial time (approximation) algorithms for polytopes.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1401.1434>)

[PDF](<https://arxiv.org/pdf/1401.1434.pdf>)
