Approximating Gromov-Hausdorff distance in Euclidean space

DOI10.1016/j.comgeo.2023.102034arXiv1912.13008OpenAlexW2997260909MaRDI QIDQ6049550

Jeffrey Scott Vitter, Carola Wenk, Sushovan Majhi

Publication date: 15 September 2023

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.13008

zbMATH Keywords

approximation algorithmGromov-Hausdorff distanceshape comparisonabstract distance measures

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Related Items (1)

Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points

Cites Work

• Unnamed Item
• Some properties of Gromov-Hausdorff distances
• Computing the minimum Hausdorff distance between two point sets on a line under translation
• Approximate matching of polygonal shapes
• A theoretical and computational framework for isometry invariant recognition of point cloud data
• Computing the Gromov-Hausdorff Distance for Metric Trees
• Low Distortion Maps Between Point Sets
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu

This page was built for publication: Approximating Gromov-Hausdorff distance in Euclidean space