Pages that link to "Item:Q811140"
From MaRDI portal
The following pages link to Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance (Q811140):
Displaying 10 items.
- Calculating the Hausdorff distance between curves (Q287214) (← links)
- Orbit of an image under iterated system (Q718459) (← links)
- Robust Hausdorff distance measure for face recognition (Q854204) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement (Q1816128) (← links)
- Modified generalized sample entropy and surrogate data analysis for stock markets (Q2199610) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- Computing the Hausdorff Distance of Two Sets from Their Distance Functions (Q5149569) (← links)
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension (Q5236371) (← links)
- A note on the Hausdorff distance between norm balls and their linear maps (Q6052489) (← links)
