Pages that link to "Item:Q1392850"
From MaRDI portal
The following pages link to Getting around a lower bound for the minimum Hausdorff distance (Q1392850):
Displaying 15 items.
- Minimum Hausdorff distance under rigid motions and comparison of protein structures (Q473041) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation (Q963332) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Computing the minimum Hausdorff distance between two point sets on a line under translation (Q1178208) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Geometric pattern matching in \(d\)-dimensional space (Q1283771) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space (Q2380079) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Computational aspects of the Hausdorff distance in unbounded dimension (Q2968119) (← links)
- (Q5044450) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- Bounds for the minimum distance function (Q5879852) (← links)
- Geometric pattern matching in d-dimensional space (Q6102306) (← links)