Gromov-Hausdorff Distances in Euclidean Spaces

Abstract

The purpose of this paper is to study the relationship between measures of dissimilarity between shapes in Euclidean space. We first concentrate on the pair Gromov-Hausdorff distance (GH) versus Hausdorff distance under the action of Euclidean isometries (EH). Then, we (1) show they are comparable in a precise sense that is not the linear behaviour one would expect and (2) explain the source of this phenomenon via explicit constructions. Finally, (3) by conveniently modifying the expression for the GH distance, we recover the EH distance. This allows us to uncover a connection that links the problem of computing GH and EH and the family of Euclidean Distance Matrix completion problems. The second pair of dissimilarity notions we study is the so called Lp-Gromov-Hausdorff distance versus the Earth Moverpsilas distance under the action of Euclidean isometries. We obtain results about comparability in this situation as well.

Cite

Text

Mémoli. "Gromov-Hausdorff Distances in Euclidean Spaces." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2008. doi:10.1109/CVPRW.2008.4563074

Markdown

[Mémoli. "Gromov-Hausdorff Distances in Euclidean Spaces." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2008.](https://mlanthology.org/cvprw/2008/memoli2008cvprw-gromovhausdorff/) doi:10.1109/CVPRW.2008.4563074

BibTeX

@inproceedings{memoli2008cvprw-gromovhausdorff,
  title     = {{Gromov-Hausdorff Distances in Euclidean Spaces}},
  author    = {Mémoli, Facundo},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops},
  year      = {2008},
  pages     = {1-8},
  doi       = {10.1109/CVPRW.2008.4563074},
  url       = {https://mlanthology.org/cvprw/2008/memoli2008cvprw-gromovhausdorff/}
}