H. Seidel, Dense Correspondence Finding for Parameterization-free Anima- 3082 tion Reconstruction from Video, Computer Vision and Pattern Recognition, pp.3083-3084, 2008.

]. C. Alpert-1999, A. B. Alpert, S. Kahng, and . Yao, Spectral partitioning with multiple eigenvectors, Discrete Applied Mathematics, vol.90, issue.1-3, pp.3-26, 1999.
DOI : 10.1016/S0166-218X(98)00083-3

]. M. Attene-2006, B. Attene, M. Falcidieno, and . Spagnuolo, Hierarchical mesh segmentation 3088 based on fitting primitives, Visual Computing, vol.3, issue.22, pp.181-193, 2006.

J. Belk and . Belk, Pullbacks and Isometries (Revised), 2011.

]. M. Belkin-2003, P. Belkin, and . Niyogi, Laplacian Eigenmaps for Dimensionality Reduction and Data Representation, Neural Computation, vol.15, issue.6, pp.1373-1396, 2003.
DOI : 10.1126/science.290.5500.2319

]. M. Belkin-2004, P. Belkin, and . Niyogi, Semi-Supervised Learning on Riemannian Manifolds, Machine Learning, vol.56, issue.1-3, p.3096
DOI : 10.1023/B:MACH.0000033120.25363.1e

]. M. Belkin-2008, J. Belkin, Y. Sun, and . Wang, Discrete laplace operator on meshed surfaces, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, p.3098
DOI : 10.1145/1377676.1377725

]. M. Belkin, J. Sun, and Y. Wang, Constructing Laplace operator from point 3101 cloud in R d, Symposium on Computational GeometryCited on 3099 pages 62 and 99 ACM-SIAM Symposium on Discrete Algorithms, pp.278-287, 2008.

]. P. Bérard-1994, G. Bérard, S. Besson, and . Gallot, Embedding Riemannian Manifolds by their, p.3104

M. Berthold, D. J. Berthold, and . Hand, Intelligent data analysis: An 3107 introduction, 1999.

M. Design, S. Bilenko, R. J. Basu, and . Mooney, (Cited on page 25 Integrating constraints and met- 3112 ric learning in semi-supervised clustering, International Conference on Machine 3113, pp.1002-1019, 2006.

]. C. Bishop, Pattern recognition and machine learning, 2006.

]. T. Biyikoglu-2007, J. Biyikoglu, P. F. Leydold, and . Stadler, Laplacian eigenvectors of graphs

]. J. Boissonnat-1998, M. Boissonnat, and . Yvinec, Algorithmic geometry. Cambridge Uni- 3119 versity Press, p.3120, 1998.

]. R. Bolles and R. A. Cain, Recognizing and Locating Partially Visible Ob- 3121 jects: The Local-Feature-Focus Method. The International Journal of Robotics Re- 3122 search, pp.57-82, 1982.

]. R. Bolles and R. A. Cain, Recognizing and Locating Partially Visible Ob- 3124 jects: The Local-Feature-Focus Method, International Journal of Robotics Research, vol.3125, issue.1 3, pp.57-82, 1982.

]. I. Borg-2005, P. J. Borg, and . Groenen, Modern Multidimensional Scaling: Theory and Ap- 3127 plications, 2005.
DOI : 10.1007/978-1-4757-2711-1

S. Borman and . Borman, The Expectation Maximization Algorithm: A short tuto- 3129 rial, p.3131, 2004.

]. Botsch, L. Kobbelt, M. Pauly, P. Alliez, and B. Lévy, Poly- 3132 gon mesh processing, 2010.

A. Vandermeulen, V. Zaharescu, and . Zobel, SHREC 2011: robust feature 3137 detection and description benchmark, Eurographics Workshop on 3D Object Re- 3138 trieval, pp.71-78, 2011.

]. A. Bronstein-2006, M. M. Bronstein, R. Bronstein, and . Kimmel, Generalized multidimen- 3140 sional scaling: a framework for isometry-invariant partial surface matching, p.3141

A. Bronstein, M. Bronstein, and R. Kimmel, Numerical ge- 3143 ometry of non-rigid shapes, Bronstein, vol.1, p.3144, 2008.

R. P. Guibas, R. Horaud, D. Kimmel, E. Knossow, . Von-lavante et al., Ovs- 3149 janikov and A. Sharma. SHREC 2010: robust correspondence benchmark (Cited on pages 6, 90 3151 and 137 Mahmoudi and 3153 G. Sapiro. A Gromov-Hausdorff framework with diffusion geometry for topologically 3154 robust non-rigid shape alignment A Gromov-Hausdorff framework with diffusion geometry for topologically 3158 robust non-rigid shape alignment, Euro- 3150 graphics Workshop on 3D Object Retrieval, pp.87-91, 2010.

]. M. Bronstein-2010d, I. Bronstein, and . Kokkinos, Scale-Invariant Heat Kernel Signatures for, p.3161

]. M. Bronstein-2011b, A. M. Bronstein, and . Bronstein, Shape Recognition with Spectral 3167

. Bruno, R. Bruno, and . Zhang, Spectral Geometry Processing, ACM 3170 SIGGRAPH Course Notes, 2010.

]. H. Bunke-1999 and . Bunke, Error Correcting Graph Matching: On the Influence of the Under- 3172 lying Cost Function, Pattern Analysis and Machine Intelligence, vol.21, issue.9, pp.3173-917, 1999.

]. Burago, Y. Burago, and S. Ivanov, A course in metric geometry. 3175, AMS Graduate Studies in Mathematics, 2001.

R. Burkard and . Burkard, Assignment problems. SIAM, Society for Industrial and, p.3177

P. Burt, T. Burt, and . Adelson, The Laplacian Pyramid as a Compact Image Code, IEEE Transaction on Communications, vol.9, issue.4, pp.532-540, 1983.

C. Chen, A. Golovinskiy, and T. Funkhouser, A Benchmark for 3188 3D Mesh Segmentation, ACM Transactions on Graphics, vol.28, issue.73, pp.1-3189, 2009.

. Cho-2010-]-minsu, J. Cho, K. Lee, and . Lee, Reweighted random walks for 3191 graph matching, European conference on Computer vision, pp.492-505

]. F. Chung-1997 and . Chung, Spectral graph theory, pp.3194-71, 1997.
DOI : 10.1090/cbms/092

]. F. Chung-2000, S. T. Chung, and . Yau, Discrete Green's Functions, Journal of Combinatorial Theory, Series A, vol.91, issue.1-2, p.3196
DOI : 10.1006/jcta.2000.3094

P. B. Dickinson and . Kantor, 3D Object Retrieval using Many-to-many Matching of 3202

T. Cour and . Cour, Solving markov random fields with spectral relaxation, Arti- 3208 ficial Intelligence and Statistics, pp.1-8, 1962.

]. J. Crowley-1984, A. C. Crowley, and . Parker, A Representation for Shape Based on Peaks 3212 and Ridges in the Difference of Low Pass Transform. Pattern Analysis and Machine 3213

. Horaud, Coherent Laplacian 3-D Protrusion Segmentation, Computer Vision and 3216 Pattern Recognition, pp.1-8, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00590250

]. A. Dempster-1977, N. M. Dempster, D. B. Laird, and . Rubin, Maximum Likelihood from In- 3221 complete Data via the EM algorithm, Journal of the Royal Statistical Society, vol.30, issue.3223, pp.1-38, 1977.

. Donoho, L. David, C. Donoho, and . Grimes, Hessian eigenmaps: Locally linear 3226 embedding techniques for high-dimensional data, National Academy of Sciences, vol.3227, issue.100 10, pp.5591-5596, 2003.

]. M. Floater-2005, K. Floater, and . Hormann, Surface parametrization: a tutorial and survey, p.3235

]. C. Fraley-2002, A. E. Fraley, and . Raftery, Model-Based Clustering, Discriminant Analysis, and Density Estimation, Journal of the American Statistical Association, vol.97, issue.458, pp.611-631, 2002.
DOI : 10.1198/016214502760047131

]. C. Fraley and A. E. Raftery, MCLUST version 3 for R: Normal Mixture Mod- 3241 eling and Model-Based Clustering, 2006.

. Garey, R. Michael, D. S. Garey, and . Johnson, Computers and intractability: A guide 3247 to the theory of np-completeness, p.3248, 1990.

]. C. Godsil-2001, G. Godsil, and . Royle, Algebraic graph theory, 1996.
DOI : 10.1007/978-1-4613-0163-9

]. A. Golovinskiy-2008, T. Golovinskiy, and . Funkhouser, Randomized cuts for 3D mesh anal- 3258 ysis, ACM Transactions on Graphics, vol.5, issue.27, pp.1-8, 2008.

G. , L. Grady, and J. R. Polimeni, Discrete Calculus: Applied Analysis on 3263 Graphs for Computational Science Alfred Gray, Elsa Abbena and Simon Salamon. Modern differential geometry 3265 of curves and surfaces with mathematica, 2006.

]. C. Grinstead-1998, L. J. Grinstead, . Snell-]-jihun, D. D. Ham, S. Lee et al., Introduction to probability American 3268 Mathematical Society A kernel 3270 view of the dimensionality reduction of manifolds, International Conference on Ma- 3271 chine Learning, pp.42-3269, 1998.

]. A. Hoffman-1953, H. W. Hoffman, and . Wielandt, The variation of the spectrum of a normal matrix, Duke Mathematical Journal, vol.20, issue.1, pp.37-39
DOI : 10.1215/S0012-7094-53-02004-3

]. T. Hou-2010, H. Hou, and . Qin, Efficient Computation of Scale-Space Features for De- 3285 formable Shape Correspondences, European Conference on Computer Vision, pp.384-397, 2010.

B. Huang, M. Adams, L. J. Wicke, and . Guibas, Non-rigid Regis- 3288 tration under Isometric Deformations, Symposium on Geometry Processing, pp.3289-1449, 2008.
DOI : 10.1111/j.1467-8659.2008.01285.x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.674.6909

C. Huang-2011-]-peng-huang, A. Budd, and . Hilton, Global temporal registration of multi, p.3291

]. R. Hummel-1987 and . Hummel, The scale-space formulation of pyramid data structures, pp.3294-107, 1987.

H. Varun-jain, O. Zhang, and . Van-kaick, NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES, International Journal of Shape Modeling, vol.13, issue.01, pp.101-124, 2007.
DOI : 10.1142/S0218654307000968

]. J. Koenderink-1984 and . Koenderink, The structure of images, Biological Cybernetics, vol.50, issue.3305, 1984.

]. R. Kondor and J. , Tsuda and J.- 3310 P. Vert, editeurs, Kernel Methods in Computational Biology, Vert. Diffusion Kernels. In B. Scholkopf, vol.3312, pp.3-3313, 2003.

]. B. Kulis, S. Basu, I. Dhillon, and R. Mooney, Semi-supervised graph clustering, Proceedings of the 22nd international conference on Machine learning , ICML '05, pp.1-22, 2009.
DOI : 10.1145/1102351.1102409

]. Y. Lai, S. M. Hu, M. R. , and P. L. Rosin, Fast mesh segmentation 3319 using random walks, Symposium on Solid and Physical Modeling, pp.183-191, 2008.
DOI : 10.1145/1364901.1364927
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.7019

A. Letouzey, E. Letouzey, and . Boyer, Progressive Shape Models Bruno Lévy. Laplace-Beltrami Eigenfunctions: Towards an Algorithm that Un- 3328 derstands Geometry, Com- 3326 puter Vision and Patern Recognition Shape Modeling International, pp.1-8, 2006.
DOI : 10.1109/cvpr.2012.6247675
URL : https://hal.inria.fr/hal-00677506/file/cvpr.pdf

]. Z. Li-2009, J. Li, and . Liu, Constrained clustering by spectral kernel learning, p.3331

]. T. Lindeberg-1994 and . Lindeberg, Scale-space theory: a basic tool for analyzing structures at different scales, Journal of Applied Statistics, vol.21, issue.1, pp.225-270, 1994.
DOI : 10.1080/757582976

. Liu-2007-]-rong, H. Liu, and . Zhang, Mesh Segmentation via Spectral Embedding and Con- 3336 tour Analysis, Computer Graphics Forum, vol.26, issue.3, pp.385-394, 2007.

L. Stuart and P. Lloyd, Least squares quantization in PCM Information Theory, pp.129-137, 1982.

]. D. Lowe-2004 and . Lowe, Distinctive Image Features from Scale-Invariant Keypoints, International Journal of Computer Vision, vol.60, issue.2, pp.91-110, 2004.
DOI : 10.1023/B:VISI.0000029664.99615.94

]. B. Luo and E. R. Hancock, A unified framework for alignment and correspondence, Computer Vision and Image Understanding, vol.92, issue.1, pp.26-55, 2003.
DOI : 10.1016/S1077-3142(03)00097-3

]. C. Luo-2009, I. Luo, Y. Safa, and . Wang, Approximating Gradients for Meshes and Point 3350 Clouds via Diffusion Metric, Symposium on Geometry Processing, pp.1497-3351, 2009.

]. M. Mahmoudi and G. Sapiro, Three-dimensional point cloud recognition via distributions of geometric distances, Graphical Models, vol.71, issue.1, pp.22-31, 2008.
DOI : 10.1016/j.gmod.2008.10.002

. Boyer, Articulated Shape Matching Using Laplacian Eigenfunctions and Unsuper- 3361 vised Point Registration, Computer Vision and Pattern Recognition, pp.1-8

. Mateus, C. Diana, and . Mateus, Spectral Tools for Unsupervised Modeling of Articulated 3365 Objects from Multiple-view Videos, p.3366

]. M. Meila-2001, J. Meila, and . Shi, Learning Segmentation by Random Walks, p.3368

. Mémoli-2004-]-facundo, G. Mémoli, and . Sapiro, Comparing point clouds, Sympo- 3371 sium on Geometry Processing, pp.32-40, 2004.

]. M. Meyer-2003, M. Meyer, P. Desbrun, A. H. Schröder, and . Barr, Discrete differential- 3373 geometry operators for triangulated 2-manifolds, Visualization and Mathematics, pp.35-57, 2003.

C. Moenning, N. A. Moenning, and . Dodgson, Fast Marching farthest point 3376 sampling for implicit surfaces and point clouds, 2003.

]. S. Mukherjee-2010, Q. Mukherjee, D. Wu, and . Zhou, Learning gradients on manifolds, Bernoulli, vol.16, issue.1
DOI : 10.3150/09-BEJ206

H. Bunke, Edit distance-based kernel functions for 3384 structural pattern classification, Pattern Recognition, vol.39, issue.10, pp.1852-3385, 2006.

]. A. Ng-2001, M. Ng, Y. Jordan, and . Weiss, On spectral clustering: analysis and an algorithm, p.3387

. Guibas, One Point Isometric Matching with the Heat Kernel, Computer Graphics, vol.3394
URL : https://hal.archives-ouvertes.fr/hal-00543885

M. Pelillo, Replicator Equations, Maximal Cliques, and Graph Isomorphism, Neural Computation, vol.2, issue.8, pp.1933-1955, 1999.
DOI : 10.1162/neco.1994.6.3.341
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.6789

]. T. Popa, I. South-dickinson, D. Bradley, A. Sheffer, and W. Heidrich, Globally 3406 Consistent Space-Time Reconstruction, Symposium on Geometry Processing, pp.3407-3408, 2010.
DOI : 10.1111/j.1467-8659.2010.01772.x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.9392

M. Reuter and . Reuter, Laplace spectra for shape recognition, Books on Demand, vol.3414

F. Reuter-2006b-]-martin-reuter, N. Wolter, and . Peinecke, Laplace???Beltrami spectra as ???Shape-DNA??? of surfaces and solids, Computer-Aided Design, vol.38, issue.4, pp.342-366, 2006.
DOI : 10.1016/j.cad.2005.10.011

]. M. Reuter-2009, S. Reuter, D. Biasotti, G. Giorgi, M. Patanè et al., Discrete 3419

M. Reuter and . Reuter, Hierarchical Shape Segmentation and Registration via??Topological Features of Laplace-Beltrami Eigenfunctions, 3423 puter Vision, pp.287-308, 2010.
DOI : 10.1007/s11263-009-0278-1

S. Rosenberg and . Rosenberg, The laplacian on a riemannian manifold, 1997.

T. Sam, L. K. Roweis, and . Saul, Nonlinear dimensionality reduction 3428 by locally linear embedding, Science, vol.290, pp.2323-2326, 2000.

. Isometry-invariant, Matching of 3D Shapes, International Journal of Computer Vision, vol.3432, issue.89, pp.248-265, 2010.

]. R. Rustamov-2007 and . Rustamov, Laplace-Beltrami eigenfunctions for deformation invari- 3434 ant shape representation, Symposium on Geometry Processing, pp.1-8, 2007.

. Isometry-driven-greedy and . Optimization, In Computer Vision and Pattern Recognition (Cited on page 127 Probabilistic subgraph 3440 matching based on convex relaxation, Energy Minimization Methods in Computer 3441 Vision and Pattern Recognition, pp.453-458, 2005.

. Schölkopf, A. J. Schölkopf, K. Smola, and . Müller, Nonlinear Component Analysis as a Kernel Eigenvalue Problem, Neural Computation, vol.20, issue.5, pp.1299-1319, 1998.
DOI : 10.1007/BF02281970

. Schölkopf, A. Schölkopf, K. Smola, and . Müller, Nonlinear Component Analysis as a Kernel Eigenvalue Problem, Neural Computation, vol.20, issue.5, pp.1299-1319, 1998.
DOI : 10.1007/BF02281970

]. G. Scott-1991, C. Scott, and . Longuet-higgins, An Algorithm for Associating the Features of Two Images, Proceedings of the Royal Society B: Biological Sciences, vol.244, issue.1309, pp.21-26, 1991.
DOI : 10.1098/rspb.1991.0045

. Szeliski, A Comparison and Evaluation of Multi-View Stereo Reconstruction Algo- 3452 rithms, Computer Vision and Pattern Recognition, 2006.

]. J. Sethian-1996 and . Sethian, A Fast Marching Level Set Method for Monotonically Advancing 3454

]. L. Shapira, A. Shamir, and D. Cohen-or, (Cited 3455 on page 144 Consistent mesh partitioning and 3457 skeletonisation using the shape diameter function, Fronts. National Academy of Sciences, pp.1591-1595, 1996.

]. L. Shapiro-1992, J. M. Shapiro, and . Brady, Feature-based correspondence: an eigenvector approach, Image and Vision Computing, vol.10, issue.5, pp.283-288, 1992.
DOI : 10.1016/0262-8856(92)90043-3

]. Sharma and R. Horaud, Shape Matching Based on Diffusion 3463 Embedding and on Mutual Isometric Consistency, CVPR workshop on Non- 3464, 2010.

G. Cech and E. Boyer, (Cited on page 62, 2010.

O. Lezoray, Image Processing and Analysing With Graphs: Theory and 3477

]. J. Shawe-taylor-2004, N. Shawe-taylor, and . Cristianini, Kernel methods in pattern analysis
DOI : 10.1017/CBO9780511809682

]. J. Shi-2000, J. Shi, and . Malik, Normalized Cuts and Image Segmentation. Pattern Analysis 3481 and Machine Intelligence, pp.888-905, 2000.

A. Shlafman-2002-]-shymon-shlafman, S. Tal, and . Katz, Metamorphosis of Polyhedral Surfaces using Decomposition, Computer Graphics Forum, vol.16, issue.5, pp.219-3485, 2002.
DOI : 10.1111/1467-8659.00581

S. Bouix and . Dickinson, Retrieving articulated 3-D models using medial surfaces

I. Sipiran, B. Sipiran, ]. G. Bustos, B. Slabaugh, T. Culbertson et al., Harris 3D: a robust extension of the Harris operator for interest point detection on 3D meshes, International 3494 Workshop on Volume Graphics, pp.963-976, 2001.
DOI : 10.1007/s00371-011-0610-y

]. D. Spielman-2007, S. Spielman, and . Teng, Spectral partitioning works: Planar graphs and finite element meshes, Linear Algebra and its Applications, vol.421, issue.2-3, pp.284-305, 2007.
DOI : 10.1016/j.laa.2006.07.020

]. J. Starck-2007a, A. Starck, and . Hilton, Correspondence labelling for wide-timeframe free- 3504 form surface matching, International Conference on Computer Vision, pp.1-8

J. Starck, A. Starck, and . Hilton, Surface Capture for Performance Based 3507

. Theobalt, Video-based reconstruction of animatable human characters, ACM SIG- 3514 GRAPH Asia, pp.139-139, 2010.

J. Sussmuth, M. Winter, and G. Greiner, Reconstructing Animated Meshes 3519 from Time-Varying Point Clouds, Scale Signature Based on Heat Diffusion Symposium on Geometry Processing, pp.1383-1392, 2008.

]. M. Szummer-2002, T. Szummer, and . Jaakkola, Partially labeled classification with Markov 3522 random walks, Advances in Neural Information Processig Systems, pp.1-8

]. J. Tenenbaum-2000, V. Tenenbaum, J. C. De-silva, and . Langford, A global geometric 3525 framework for nonlinear dimensionality reduction, Science, vol.290, issue.3527, pp.3526-2319, 2000.

. Seidel, Isometric Registration of Ambiguous Partial Data, Computer Vision and 3529 Pattern Recognition Ivo Ihrke and Hans-Peter Seidel. 3531 Intrinsic Shape Matching by Planned Landmark Sampling. In Computer Graphics 3532, pp.1185-1192, 2009.

N. Thorstensen and . Thorstensen, Manifold learning and applications to shape and 3534 image processing, Ècole Nationale des Ponts et Chausseés, p.3535

F. Tombari, S. Tombari, L. D. Salti, and . Stefano, Performance Eval- 3537 uation of 3D Keypoint Detectors, International Journal of Computer Vision, vol.3539, pp.3538-3539, 2010.

]. B. Vallet-2008, B. L. Vallet, H. Oliver-van-kaick, and . Zhang, Manifold harmonics Ghassan Hamarneh and Danial Cohen-Or. A 3550 Survey on Shape Correspondence, Computer Graphics Forum Computer Graphics Forum, vol.3548, issue.30 6, pp.251-260, 2008.

. Varanasi-2008-]-kiran, A. Varanasi, E. Zaharescu, R. Boyer, and . Horaud, Tem- 3553 poral Surface Tracking using Mesh Evolution, European Conference on Computer 3554

W. Hong-fang, E. R. Wang, and . Hancock, Correspondence matching using ker- 3565 nel principal components analysis and label consistency constraints, pp.1012-1025, 2006.

]. M. Wardetzky-2007, S. Wardetzky, F. Mathur, E. Kälberer, and . Grinspun, Discrete Laplace 3572 operators: No free lunch, Symposium on Geometry Processing, pp.33-37, 2007.

]. M. Wardetzky-2008 and . Wardetzky, Convergence of the Cotangent Formula: An Overview, Discrete 3576 Differential Geometry, pp.89-112, 2008.
DOI : 10.1007/978-3-7643-8621-4_15

]. J. Wilkinson-1965 and . Wilkinson, The algebraic eigenvalue problem, 1965.

]. J. Wilkinson-1970 and . Wilkinson, Elementary Proof of the Wielandt-Hoffman Theorem and 3580 of its Generalization, p.3581, 1970.

. Wu, . Huai-yu, H. Wu, T. Zha, X. Luo et al., Global and 3583 local isometry-invariant descriptor for 3D shape comparison and partial matching, p.3584
DOI : 10.1109/cvpr.2010.5540180

. Wu, . Huai-yu, H. Wu, and . Zha, Robust consistent correspondence between 3D 3586 non-rigid shapes based on "Dual Shape-DNA, International Conference on Com- 3587 puter Vision, pp.587-594, 2011.

]. E. Xing-2002, A. Y. Xing, M. I. Ng, S. J. Jordan, and . Russell, Distance Metric Learning 3589 with Application to Clustering with Side-Information, Advances in Neural Infor- 3590

Y. , ]. S. Yu, and J. Shi, Multiclass Spectral Clustering, International Conference 3592 on Computer Vision, pp.1-8, 2003.
DOI : 10.1109/iccv.2003.1238361
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.4538

Y. , ]. S. Yu, and J. Shi, Segmentation Given Partial Grouping Constraints

]. Y. Zeng-2010a, C. Zeng, Y. Wang, X. Wang, D. Gu et al., Dense non- 3614 rigid surface registration using high order graph matching, p.3615

N. Paragios, Dense Non-rigid Registration Using High Order Graph Matching, p.3618
URL : https://hal.archives-ouvertes.fr/hal-00856064

]. H. Zhang-2008, A. Zhang, D. Sheffer, Q. Cohen-or, O. Zhou et al., Tagliasac- 3623 chi. Deformation-Driven Shape Correspondence, Computer Graphics Forum, vol.25, issue.3624 5, pp.1431-1439, 2008.