Computing the minimum Hausdorff distance between two point sets on a line under translation
From MaRDI portal
Publication:1178208
DOI10.1016/0020-0190(91)90233-8zbMath0736.68078OpenAlexW2103404435MaRDI QIDQ1178208
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90233-8
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (16)
Novel semi-metrics for multivariate change point analysis and anomaly detection ⋮ Optimizing the geometrical accuracy of curvilinear meshes ⋮ Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation ⋮ New clustering methods for interval data ⋮ Approximating Gromov-Hausdorff distance in Euclidean space ⋮ Distance and similarity measures for dual hesitant fuzzy sets and their applications in pattern recognition ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points ⋮ COMPUTATION OF THE HAUSDORFF DISTANCE BETWEEN TWO ELLIPSES ⋮ Minimum Hausdorff distance under rigid motions and comparison of protein structures ⋮ A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation ⋮ The upper envelope of Voronoi surfaces and its applications ⋮ Efficient indexing of interval time sequences ⋮ Distance and similarity measures of hesitant fuzzy sets based on Hausdorff metric with applications to multi-criteria decision making and clustering ⋮ A graph b-coloring framework for data clustering ⋮ A new measure between sets of probability distributions with applications to erratic financial behavior
Cites Work
This page was built for publication: Computing the minimum Hausdorff distance between two point sets on a line under translation
