Multiple shape correspondence problem solved w/ a cool approximation solution based on dynamic programming; another approximation based on shortest path (referred to as the sequential algorithm in the paper) and the optimal solution based on exponential search is also provided in this package to be selected by command-line arguments. Algorithms are explained in the paper to be cited below.

x64 and x86 codes are exactly the same. I provide both w/ the associated visual studio files to make further updating/compiling possible (command line arguments are good enough but just in case). For the paper, I used x64 platform. Code is pretty portable except <windows.h> for timing which is commented-out in the public release so shouldn't be a problem.




================ citation ================

Y. Sahillioglu and Y. Yemez, Multiple Shape Correspondence by Dynamic Programming, Computer Graphics Forum (Proc. PG), 2014.



--ysf
