Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence

Simple item page
dc.contributor.authorSahillioglu, Yusufen_US
dc.contributor.authorYemez, Yucelen_US
dc.contributor.editorMario Botsch and Scott Schaeferen_US
dc.date.accessioned2015-02-27T15:03:09Z
dc.date.available2015-02-27T15:03:09Z
dc.date.issued2011en_US
dc.description.abstractWe present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse-to-fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum-distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/j.1467-8659.2011.02020.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2011.02020.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subject3D Shape Correspondenceen_US
dc.subjectCoarseen_US
dc.subjecttoen_US
dc.subjectfine samplingen_US
dc.subjectcombinatorial matchingen_US
dc.subjectisometric dense shape correspondenceen_US
dc.titleCoarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondenceen_US
Files
Collections
30-Issue 5
SGP11: Eurographics Symposium on Geometry Processing