Z. B. Azouz, P. Bose, C. Shu, and S. Wuhrer, Approximations of geodesic distances for incomplete triangular manifolds, Canadian Conference on Computational Geometry, 2007.

P. Bose, A. Maheshwari, C. Shu, and S. Wuhrer, A survey of geodesic paths on 3D surfaces, Computational Geometry, vol.44, issue.9, pp.486-498, 2011.
DOI : 10.1016/j.comgeo.2011.05.006

A. M. Bronstein, M. M. Bronstein, and R. Kimmel, Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching, Proceedings of the National Academies of Sciences, pp.1168-1172, 2006.
DOI : 10.1073/pnas.0508601103

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

A. Elad and R. Kimmel, On bending invariant signatures for surfaces. Transactions on Pattern Analysis and Machine Intelligence, pp.1285-1295, 2003.

Y. Eldar, M. Lindenbaum, M. Porat, and Y. Y. Zeevi, The farthest point strategy for progressive image sampling, IEEE Transactions on Image Processing, vol.6, issue.9, pp.1305-1315, 1997.
DOI : 10.1109/83.623193

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.
DOI : 10.1137/0132071

J. Giard and B. Macq, From mesh parameterization to geodesic distance estimation, European Workshop on Computational Geometry, 2009.

T. Gonzales, Clustering to minimize the maximum intercluster distance, Theoretical Computer Science, vol.38, pp.293-306, 1985.
DOI : 10.1016/0304-3975(85)90224-5

M. R. Henzinger, P. N. Klein, S. Rao, and S. Subramanian, Faster Shortest-Path Algorithms for Planar Graphs, Journal of Computer and System Sciences, vol.55, issue.1, pp.3-23, 1997.
DOI : 10.1006/jcss.1997.1493

J. Könemann, Y. Li, A. Sinha, and O. Parekh, An approximation algorithm for the edge-dilation k-center problem, Operations Research Letters, vol.32, issue.5, pp.491-495, 2004.
DOI : 10.1016/j.orl.2003.11.011

Y. Lipman and T. Funkhouser, Möbius voting for surface correspondence, Proceedings of SIGGRAPH, pp.1-72, 2009.

F. Mémoli and G. Sapiro, Comparing point clouds, Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing , SGP '04, pp.32-40, 2004.
DOI : 10.1145/1057432.1057436

C. Moenning and N. A. Dodgson, Fast marching farthest point sampling, Eurographics Poster Presentation, 2003.

M. Ruggeri, G. Patane, M. Spagnuolo, and D. Saupe, Spectral-Driven Isometry-Invariant Matching of 3D Shapes, International Journal of Computer Vision, vol.27, issue.5, pp.248-265, 2010.
DOI : 10.1007/s11263-009-0250-0

J. Sun, M. Ovsjanikov, and L. Guibas, A Concise and Provably Informative Multi-Scale Signature Based on Heat Diffusion, Proceedings of SGP, pp.1383-1392, 2009.
DOI : 10.1111/j.1467-8659.2009.01515.x

A. Tevs, A. Berner, M. Wand, I. Ihrke, and H. Seidel, Intrinsic Shape Matching by Planned Landmark Sampling, Proceedings of Eurographics, pp.543-552, 2011.
DOI : 10.1111/j.1467-8659.2011.01879.x

L. G. Valiant, Universality considerations in VLSI circuits, IEEE Transactions on Computers, vol.30, issue.2, pp.135-140, 1981.
DOI : 10.1109/TC.1981.6312176

S. Wuhrer, Matching and Morphing of Isometric Models, 2009.

S. Wuhrer, C. Shu, Z. B. Azouz, and P. Bose, POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS, International Journal of Shape Modeling, vol.13, issue.02, pp.139-157, 2007.
DOI : 10.1142/S0218654307000981