A linear time algorithm for the Hausdorff distance between convex polygons
From MaRDI portal
Publication:595374
DOI10.1016/0020-0190(83)90042-XzbMath0527.68051OpenAlexW1977957682MaRDI QIDQ595374
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90042-x
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items
Between shapes, using the Hausdorff distance ⋮ Novel semi-metrics for multivariate change point analysis and anomaly detection ⋮ Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases ⋮ Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers ⋮ Unnamed Item ⋮ An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing ⋮ Clustering reduced interval data using Hausdorff distance ⋮ Approximate matching of polygonal shapes ⋮ A note on the Hausdorff distance between norm balls and their linear maps ⋮ Equivalence relations and \(L^p\) distances between time series with application to the black summer Australian bushfires ⋮ Precise Hausdorff distance computation between polygonal meshes ⋮ The complexity of the Hausdorff distance ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Unnamed Item ⋮ Computing the Hausdorff Distance of Two Sets from Their Distance Functions ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ The upper envelope of Voronoi surfaces and its applications ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ A new metric between polygons, and how to compute it ⋮ Approximation of convex sets by polytopes ⋮ Grid peeling and the affine curve-shortening flow ⋮ A new measure between sets of probability distributions with applications to erratic financial behavior ⋮ Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance ⋮ A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
Cites Work
