Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance

DOI10.1016/0020-0190(91)90101-MzbMath0734.68097OpenAlexW2003630662MaRDI QIDQ811140

N. E. Zubov

Publication date: 1991

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90101-m

zbMATH Keywords

image processingmetric field

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Calculating the Hausdorff distance between curves ⋮ Robust Hausdorff distance measure for face recognition ⋮ Modified generalized sample entropy and surrogate data analysis for stock markets ⋮ Orbit of an image under iterated system

Cites Work

• Unnamed Item
• A linear time algorithm for the Hausdorff distance between convex polygons
• Iterated function systems and the global construction of fractals

This page was built for publication: Computing the Hausdorff set distance in linear time for any \(L_ p\) point distance