A linear time algorithm for the Hausdorff distance between convex polygons

Cites Work

Title not available (Why is that?)

Cited In (24)

Between shapes, using the Hausdorff distance
A new measure between sets of probability distributions with applications to erratic financial behavior
Grid peeling and the affine curve-shortening flow
The complexity of the Hausdorff distance
A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance
Hausdorff distance between convex semialgebraic sets
Computing the Hausdorff Distance of Two Sets from Their Distance Functions
Precise Hausdorff distance computation between polygonal meshes
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
Title not available (Why is that?)
The upper envelope of Voronoi surfaces and its applications
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
Approximation of convex sets by polytopes
Title not available (Why is that?)
Approximate matching of polygonal shapes
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
A note on the Hausdorff distance between norm balls and their linear maps
A new metric between polygons, and how to compute it
Simple algorithms for partial point set pattern matching under rigid motion
Novel semi-metrics for multivariate change point analysis and anomaly detection
Convergence analysis of multivariate McCormick relaxations

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)