Pages that link to "Item:Q2434923"
From MaRDI portal
The following pages link to On the complexity of computing the Hausdorff distance (Q2434923):
Displaying 11 items.
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- An algorithm for the computation of the Hutchinson distance (Q1183452) (← links)
- The Boolean map distance: theory and efficient computation (Q1690418) (← links)
- The computational significance of Hausdorff's maximal chain principle (Q2106609) (← links)
- Computing the Monge-Kantorovich distance (Q2403116) (← links)
- Computing the Hausdorff distance between two sets of parametric curves (Q2868496) (← links)
- Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
- (Q5044450) (← links)
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al. (Q5678749) (← links)