K. Wang, G. Lavoué, F. Denis, and A. Baskurt, A Comprehensive Survey on Three-Dimensional Mesh Watermarking, IEEE Transactions on Multimedia, vol.10, issue.8, pp.1513-1540, 2008.
DOI : 10.1109/TMM.2008.2007350

J. Peng, C. Kim, J. Kuo, and C. , Technologies for 3D mesh compression: A survey, Journal of Visual Communication and Image Representation, vol.16, issue.6, pp.688-733, 2005.
DOI : 10.1016/j.jvcir.2005.03.001

P. Amat, W. Puech, S. Druon, and J. Pedeboy, Lossless 3D steganography based on MST and connectivity modification, Signal Processing: Image Communication, vol.25, issue.6, pp.400-412, 2010.
DOI : 10.1016/j.image.2010.05.002

URL : https://hal.archives-ouvertes.fr/lirmm-00600701

H. Hoppe, T. Derose, T. Duchamp, J. Mcdonald, and W. Stuetzle, Surface reconstruction from unorganized points, ACM SIGGRAPH Computer Graphics, vol.26, issue.2, pp.71-79, 1992.
DOI : 10.1145/142920.134011

P. Franco, J. Ogier, P. Loonis, and R. Mullot, A topological measure for image object recognition. Lecture notes in computer science, pp.279-90, 2004.

M. Vlachos, C. Lucchese, D. Rajan, and P. Yu, Ownership protection of shape datasets with geodesic distance preservation, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, 2008.
DOI : 10.1145/1353343.1353379

B. Merry, P. Marais, and J. Gain, Compression of dense and regular point clouds In: Proceedings of the 4th international conference on computer graphics, virtual reality, visualisation and interaction in africa, ser. AFRIGRAPH'06, pp.15-20, 2006.

S. Wuhrer and A. Brunton, Segmenting animated objects into near-rigid components, The Visual Computer, vol.23, issue.3, pp.147-55, 2010.
DOI : 10.1007/s00371-009-0394-5

W. Wang, G. Zheng, J. Yong, and H. Gu, A numerically stable fragile watermarking scheme for authenticating 3D models, Computer-Aided Design, vol.40, issue.5, pp.634-679, 2008.
DOI : 10.1016/j.cad.2008.03.001

URL : https://hal.archives-ouvertes.fr/inria-00517327

R. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

R. Ohbuchi, H. Masuda, and M. Aono, Watermaking three-dimensional polygonal models, Proceedings of the fifth ACM international conference on Multimedia , MULTIMEDIA '97, pp.261-72, 1997.
DOI : 10.1145/266180.266377

X. Mao, M. Shiba, and A. Imamiya, <title>Watermarking 3D geometric models through triangle subdivision</title>, Security and Watermarking of Multimedia Contents III, pp.253-60, 2001.
DOI : 10.1117/12.435406

F. Cayre and B. Macq, Data hiding on 3-D triangle meshes, IEEE Transactions on Signal Processing, vol.51, issue.4, pp.939-988, 2003.
DOI : 10.1109/TSP.2003.809380

J. Tierny, J. Vandeborre, and M. Daoudi, Topology driven 3D mesh hierarchical segmentation, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07), pp.215-235, 2007.
DOI : 10.1109/SMI.2007.38

URL : https://hal.archives-ouvertes.fr/hal-00725321

M. Luo and A. Bors, Surface-preserving robust watermarking of 3-D shapes, IEEE Trans Image Process, vol.20, issue.10, pp.2813-2839, 2011.

K. Wang, G. Lavoué, F. Denis, and A. Baskurt, Robust and blind watermarking of polygonal meshes based on volume moments, LIRIS UMR 5205, tech. rep. RR-LIRIS-2009-001, 2009.

K. Wang, M. Luo, A. Bors, and F. Denis, Blind and robust mesh watermarking using manifold harmonics, 2009 16th IEEE International Conference on Image Processing (ICIP), pp.3657-60
DOI : 10.1109/ICIP.2009.5414248

URL : https://hal.archives-ouvertes.fr/hal-00958603

J. Rossignac, Edgebreaker: connectivity compression for triangle meshes, IEEE Transactions on Visualization and Computer Graphics, vol.5, issue.1, pp.47-61, 1999.
DOI : 10.1109/2945.764870

A. Bogomjakov, C. Gotsman, and M. Isenburg, Distortion-Free Steganography for Polygonal Meshes, Computer Graphics Forum, vol.27, issue.2, pp.637-679, 2008.
DOI : 10.1111/j.1467-8659.2008.01161.x

N. Wang and C. Men, Reversible fragile watermarking for 2-D vector map authentication with localization, Computer-Aided Design, vol.44, issue.4, pp.320-350, 2012.
DOI : 10.1016/j.cad.2011.11.001

K. Jr and J. , On the shortest spanning subtree of a graph and the traveling salesman problem, Proc Amer Math Soc, vol.7, issue.1, pp.48-50, 1956.

E. Gordeev, Stability analysis of the minimum spanning tree problem, Comput Math Math Phys, vol.39, issue.5, pp.738-784, 1999.

E. Gordeev, Stability analysis in optimization problems on matroids in the metric l1, Cybernetics and Systems Analysis, vol.37, issue.2, pp.251-260, 2001.
DOI : 10.1023/A:1016703204124

B. Dixon, M. Rauch, and R. Tarjan, Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time, SIAM Journal on Computing, vol.21, issue.6, pp.1184-992, 1992.
DOI : 10.1137/0221070

H. Yaman, O. Kara?an, and M. P?nar, The robust spanning tree problem with interval data, Operations Research Letters, vol.29, issue.1, pp.31-40, 2001.
DOI : 10.1016/S0167-6377(01)00078-5

Z. Su, W. Li, J. Kong, Y. Dai, and W. Tang, Watermarking 3D CAPD models for topology verification, Computer-Aided Design, vol.45, issue.7, pp.1042-52, 2013.
DOI : 10.1016/j.cad.2013.04.001