Z. Ben-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-Theory and Applications, vol.44, issue.9, pp.486-498, 2011.

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, vol.103, pp.1168-1172, 2006.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

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

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

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is NPComplete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.

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

T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoretical Computer Science, vol.38, pp.293-306, 1985.

P. Kamousi, S. Lazard, A. Maheshwari, and S. Wuhrer, Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph, Research report, INRIA, November, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00927643

J. Könemann, Y. Li, O. Parekh, and A. Sinha, Approximation algorithms for edgedilation k-center problems, Scandinavian Workshop on Algorithms Theory, 2002.

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.

F. Mémoli and G. Sapiro, Comparing point clouds, Symposium on Geometry Processing, pp.32-40, 2004.

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

M. Ruggeri and D. Saupe, Isometry-invariant matching of point set surfaces, Eurographics Workshop on 3D Object Retrieval, pp.17-24, 2008.

S. Wuhrer, C. Shu, Z. Ben-azouz, and P. Bose, Posture invariant correspondence of incomplete triangular manifolds, International Journal of Shape Modeling, vol.13, issue.2, pp.139-157, 2007.

C. Wulff-nielsen, Approximate distance oracles for planar graphs with improved query time-space tradeoff, Symposium on Discrete Algorithms, 2016.