Approximations of geodesic distances for incomplete triangular manifolds, Canadian Conference on Computational Geometry, 2007. ,
A survey of geodesic paths on 3d surfaces, Computational Geometry-Theory and Applications, vol.44, issue.9, pp.486-498, 2011. ,
Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching, Proceedings of the National Academies of Sciences, vol.103, pp.1168-1172, 2006. ,
A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959. ,
On bending invariant signatures for surfaces, Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.10, pp.1285-1295, 2003. ,
The farthest point strategy for progressive image sampling, Transactions on Image Processing, vol.6, issue.9, pp.1305-1315, 1997. ,
The Rectilinear Steiner Tree Problem is NPComplete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977. ,
From mesh parameterization to geodesic distance estimation, European Workshop on Computational Geometry, 2009. ,
Clustering to minimize the maximum intercluster distance, Theoretical Computer Science, vol.38, pp.293-306, 1985. ,
Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph, Research report, INRIA, November, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00927643
Approximation algorithms for edgedilation k-center problems, Scandinavian Workshop on Algorithms Theory, 2002. ,
An approximation algorithm for the edge-dilation k-center problem, Operations Research Letters, vol.32, issue.5, pp.491-495, 2004. ,
Comparing point clouds, Symposium on Geometry Processing, pp.32-40, 2004. ,
Fast marching farthest point sampling, Eurographics Poster Presentation, vol.562, 2003. ,
Isometry-invariant matching of point set surfaces, Eurographics Workshop on 3D Object Retrieval, pp.17-24, 2008. ,
Posture invariant correspondence of incomplete triangular manifolds, International Journal of Shape Modeling, vol.13, issue.2, pp.139-157, 2007. ,
Approximate distance oracles for planar graphs with improved query time-space tradeoff, Symposium on Discrete Algorithms, 2016. ,