Show simple item record

dc.contributor.authorMemoli, Facundoen_US
dc.contributor.editorM. Botsch and R. Pajarola and B. Chen and M. Zwickeren_US
dc.date.accessioned2014-01-29T16:52:11Z
dc.date.available2014-01-29T16:52:11Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905673-51-7en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SPBG/SPBG07/081-090en_US
dc.description.abstractIt 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling.en_US
dc.titleOn the use of Gromov-Hausdorff Distances for Shape Comparisonen_US
dc.description.seriesinformationEurographics Symposium on Point-Based Graphicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record