Pages that link to "Item:Q1178208"
From MaRDI portal
The following pages link to Computing the minimum Hausdorff distance between two point sets on a line under translation (Q1178208):
Displayed 5 items.
- New clustering methods for interval data (Q880906) (← links)
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation (Q963332) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)