Pages that link to "Item:Q2968119"
From MaRDI portal
The following pages link to Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119):
Displaying 8 items.
- Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance (Q811140) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- The computational significance of Hausdorff's maximal chain principle (Q2106609) (← links)
- Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales (Q2329045) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- A note on the Hausdorff distance between norm balls and their linear maps (Q6052489) (← links)