Abstract
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for the complexity class ∀ ∃
Author supplied keywords
Cite
CITATION STYLE
APA
Jungeblut, P., Kleist, L., & Miltzow, T. (2024). The Complexity of the Hausdorff Distance. Discrete and Computational Geometry, 71(1), 177–213. https://doi.org/10.1007/s00454-023-00562-5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free