A linear time algorithm for the Hausdorff distance between convex polygons

Cited in

(23)

scientific article; zbMATH DE number 7765371 (Why is no real title available?)
Simple algorithms for partial point set pattern matching under rigid motion
A linear-time algorithm and analysis of graph relative Hausdorff distance
Approximate matching of polygonal shapes
Computing the Hausdorff distance of two sets from their distance functions
Between shapes, using the Hausdorff distance
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
A note on the Hausdorff distance between norm balls and their linear maps
The complexity of the Hausdorff distance
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Equivalence relations and \(L^p\) distances between time series with application to the black summer Australian bushfires
The upper envelope of Voronoi surfaces and its applications
Approximation of convex sets by polytopes
Precise Hausdorff distance computation between polygonal meshes
A new metric between polygons, and how to compute it
Convergence analysis of multivariate McCormick relaxations
Novel semi-metrics for multivariate change point analysis and anomaly detection
Hausdorff distance between convex semialgebraic sets
Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases
Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance
The Hausdorff distance between some sets of points
A new measure between sets of probability distributions with applications to erratic financial behavior

This page was built for publication: A linear time algorithm for the Hausdorff distance between convex polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595374)