Large-scale integer linear programming for orientation preserving 3d shape matching

Thomas Windheuser, Ulrich Schlickewei, Frank R. Schimdt, Daniel Cremers

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


We 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.

Original languageEnglish
Pages (from-to)1471-1480
Number of pages10
JournalEurographics Symposium on Geometry Processing
Issue number5
StatePublished - 2011


  • Categories and subject descriptors (according to ACM CCS)
  • Computational geometry and object modeling
  • I.3.5 [Computer graphics]


Dive into the research topics of 'Large-scale integer linear programming for orientation preserving 3d shape matching'. Together they form a unique fingerprint.

Cite this