LIPIcs.SoCG.2022.48.pdf
- Filesize: 1.36 MB
- 17 pages
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 ∀∃_<ℝ. This implies that the problem is NP-, co-NP-, ∃ℝ- and ∀ℝ-hard.
Feedback for Dagstuhl Publishing