Memoli, FacundoM. Botsch and R. Pajarola and B. Chen and M. Zwicker2014-01-292014-01-292007978-3-905673-51-71811-7813https://doi.org/10.2312/SPBG/SPBG07/081-090It is the purpose of this paper to propose and discuss certain modifications of the ideas concerning Gromov- Hausdorff distances in order to tackle the problems of shape matching and comparison. These reformulations render these distances more amenable to practical computations without sacrificing theoretical underpinnings. A second goal of this paper is to establish links to several other practical methods proposed in the literature for comparing/matching shapes in precise terms. Connections with the Quadratic Assignment Problem (QAP) are also established, and computational examples are presented.Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling.