Large-Scale Integer Linear Programming for Orientation Preserving 3D Shape Matching

Simple item page
dc.contributor.authorWindheuser, Thomasen_US
dc.contributor.authorSchlickewei, Ulrichen_US
dc.contributor.authorSchmidt, Frank R.en_US
dc.contributor.authorCremers, Danielen_US
dc.contributor.editorMario Botsch and Scott Schaeferen_US
dc.date.accessioned2015-02-27T15:03:10Z
dc.date.available2015-02-27T15:03:10Z
dc.date.issued2011en_US
dc.description.abstractWe study an algorithmic framework for computing an elastic orientation-preserving matching of non-rigid 3D shapes. We outline an Integer Linear Programming formulation whose relaxed version can be minimized globally in polynomial time. Because of the high number of optimization variables, the key algorithmic challenge lies in efficiently solving the linear program. We present a performance analysis of several Linear Programming algorithms on our problem. Furthermore, we introduce a multiresolution strategy which allows the matching of higher resolution models.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.doi10.1111/j.1467-8659.2011.02021.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2011.02021.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.subjectI.3.5 [Computer Graphics]en_US
dc.subjectComputational Geometry and Object Modelingen_US
dc.titleLarge-Scale Integer Linear Programming for Orientation Preserving 3D Shape Matchingen_US
Files
Collections
30-Issue 5
SGP11: Eurographics Symposium on Geometry Processing