A linear time algorithm for the Hausdorff distance between convex polygons

Cited in

(24)

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

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)