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.68078MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68T10: Pattern recognition, speech recognition
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
New clustering methods for interval data, A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation, Efficient indexing of interval time sequences, A graph b-coloring framework for data clustering, The upper envelope of Voronoi surfaces and its applications, Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
Cites Work