[1] Li R Z, Liu Y Y, Yang M et al. Three-dimensional point cloud segmentation algorithm based on improved region growing[J]. Laser & Optoelectronics Progress, 55, 051502(2018).

[2] Huang Q X, Guibas L. Consistent shape maps via semidefinite programming[J]. Computer Graphics Forum, 32, 177-186(2013). http://onlinelibrary.wiley.com/doi/10.1111/cgf.12184/pdf

[3] Pachauri D, Kondor R, Singhz V. Solving the multi-way matching problem by permutation synchronization[J]. Advances in Neural Information Processing Systems, 1860-1868(2013).

[4] Ovsjanikov M, Corman E, Bronstein M et al. Computing and processing correspondences with functional maps[C]. //SIGGRAPH Asia, [S. l. : S. n.], 9-71(2016).

[5] Eynard D, Rodola E, Glashoff K et al. Coupled functional maps[C]. //2016 Fourth International Conference on 3D Vision (3DV), October 25-28, 2016, Stanford, CA, USA. New York: IEEE, 399-407(2016).

[6] Zhang Z, Xu H L, Yin H. A fast point cloud registration algorithm based on key point selection[J]. Laser & Optoelectronics Progress, 54, 121002(2017).

[7] Aflalo Y, Dubrovina A, Kimmel R. Spectral generalized multi-dimensional scaling[J]. International Journal of Computer Vision, 118, 380-392(2016). http://link.springer.com/article/10.1007/s11263-016-0883-8

[8] Ovsjanikov M, Mérigot Q, Mémoli F et al. One point isometric matching with the heat kernel[J]. Computer Graphics Forum, 29, 1555-1564(2010). http://onlinelibrary.wiley.com/doi/10.1111/j.1467-8659.2010.01764.x/pdf

[9] Vestner M, Litman R, Rodola E et al. Product manifold filter: Non-rigid shape correspondence via kernel density estimation in the product space[C]. //2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), July 21-26, 2017, Honolulu, HI, USA. New York: IEEE, 6681-6690(2017).

[10] Ovsjanikov M, Ben-Chen M, Solomon J et al. Functional maps: A flexible representation of maps between shapes[J]. ACM Transactions on Graphics, 31, 1-11(2012). http://dl.acm.org/citation.cfm?id=2185526

[11] Corman E, Ovsjanikov M, Chambolle A. Supervised descriptor learning for non-rigid shape matching[C]. //Corman E, Ovsjanikov M, Chambolle A. eds. Computer Vision - ECCV 2014 Workshops. Cham: Springer International Publishing, 283-298(2015).

[12] Xiong F G, Huo W, Han X et al. Removal method of mismatching keypoints in 3D point cloud[J]. Acta Optica Sinica, 38, 0210003(2018).

[13] Maron H, Dym N, Kezurer I et al. Point registration via efficient convex relaxation[J]. ACM Transactions on Graphics, 35, 73-85(2016). http://dl.acm.org/citation.cfm?id=2925913

[14] Nogneng D, Melzi S, Rodola E et al. Improved functional mappings via product preservation[J]. Computer Graphics Forum, 37, 179-190(2018).

[15] Huang Q X, Wang F, Guibas L. Functional map networks for analyzing and exploring large shape collections[J]. ACM Transactions on Graphics, 33, 1-11(2014). http://dl.acm.org/citation.cfm?id=2601111

[16] Sahillioglu Y, Yemez Y. Multiple shape correspondence by dynamic programming[J]. Computer Graphics Forum, 33, 121-130(2014). http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1111%2Fcgf.12480

[17] Cosmo L, Rodola E, Albarelli A et al. Consistent partial matching of shape collections via sparse modeling[J]. Computer Graphics Forum, 36, 209-221(2017). http://onlinelibrary.wiley.com/doi/10.1111/cgf.12796/pdf

[18] Kamousi P, Lazard S, Maheshwari A et al. Analysis of farthest point sampling for approximating geodesics in a graph[J]. Computational Geometry, 57, 1-7(2016). http://www.sciencedirect.com/science/article/pii/S0925772116300487

[19] Dijkstra E W. A note on two problems inconnexion with graphs[J]. Numerische Mathematik, 1, 269-271(1959). http://www.ams.org/mathscinet-getitem?mr=107609

[20] Rodola E, Moeller M. Cremers D. Regularized pointwise map recovery from functional correspondence[EB/OL]. (2015-06-18)[2018-10-01]. https:∥arxiv.org/abs/1506.05603v1.. http://onlinelibrary.wiley.com/doi/10.1111/cgf.13160/pdf

[21] Nogneng D, Ovsjanikov M. Informative descriptor preservation via commutativity for shape matching[J]. Computer Graphics Forum, 36, 259-267(2017). http://dl.acm.org/citation.cfm?id=3129000