On the complexity of computing the Hausdorff distance
From MaRDI portal
Publication:2434923
DOI10.1016/j.jco.2013.03.002zbMath1286.68238OpenAlexW2021081859MaRDI QIDQ2434923
Publication date: 3 February 2014
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2013.03.002
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of computability and recursion theory (03D80)
Related Items
In Memoriam: Ker-I Ko (1950–2018) ⋮ Who Asked Us? How the Theory of Computing Answers Questions about Analysis
Cites Work
- The computational complexity of distance functions of two-dimensional domains
- Computational complexity of real functions
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Point-Separable Classes of Simple Computable Planar Curves
- Computational Complexity of Two-Dimensional Regions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item