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):
Displaying 16 items.
- Minimum Hausdorff distance under rigid motions and comparison of protein structures (Q473041) (← links)
- 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)
- Efficient indexing of interval time sequences (Q975510) (← 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)
- Novel semi-metrics for multivariate change point analysis and anomaly detection (Q2127415) (← links)
- Distance and similarity measures of hesitant fuzzy sets based on Hausdorff metric with applications to multi-criteria decision making and clustering (Q2318295) (← links)
- Optimizing the geometrical accuracy of curvilinear meshes (Q2375013) (← links)
- Distance and similarity measures for dual hesitant fuzzy sets and their applications in pattern recognition (Q2953541) (← links)
- COMPUTATION OF THE HAUSDORFF DISTANCE BETWEEN TWO ELLIPSES (Q4603405) (← links)
- A new measure between sets of probability distributions with applications to erratic financial behavior (Q5020029) (← links)
- Approximating Gromov-Hausdorff distance in Euclidean space (Q6049550) (← links)
- Hausdorff distance between convex semialgebraic sets (Q6154398) (← links)
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points (Q6182460) (← links)
