L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representation of triangulations with a boundary, Proc. of WADS, pp.134-145, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090707

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Dynamic update of succinct triangulations, Proc. of CCCG, pp.135-138, 2005.

P. Alliez and C. Gotsman, Recent Advances in Compression of 3D Meshes, Advances in Multiresolution for Geometric Modelling, pp.3-26, 2005.
DOI : 10.1007/3-540-26808-1_1
URL : https://hal.archives-ouvertes.fr/inria-00071613

D. Blanford, G. Blelloch, and I. Kash, Compact representations of separable graphs, Proc. SODA, pp.342-351, 2003.

Y. Chiang, C. Lin, and H. Lu, Orderly spanning trees with applications to graph encoding and graph drawing, Proc. of SODA, pp.506-515, 2001.

R. C. Chuang, A. Garg, X. He, M. Kao, and H. Lu, Compact encodings of planar graphs via canonical orderings and multiple parentheses, Proc. of ICALP, pp.118-129, 1998.
DOI : 10.1007/BFb0055046

E. Fusy, D. Poulalhon, and G. Schaeffer, Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling, Proc. of SODA, pp.690-699, 2005.
DOI : 10.1145/1361192.1361196
URL : https://hal.archives-ouvertes.fr/hal-00330580

R. Geary, R. Raman, and V. Raman, Succint ordinal trees with level-ancestor queries, Proc. of SODA, pp.1-10, 2004.

G. Jacobson, Space-efficient static trees and graphs, 30th Annual Symposium on Foundations of Computer Science, pp.549-554, 1989.
DOI : 10.1109/SFCS.1989.63533

K. Keeler and J. Westbrook, Short encodings of planar graphs and maps, Discrete Applied Mathematics, vol.58, issue.3, pp.239-252, 1995.
DOI : 10.1016/0166-218X(93)E0150-W

A. Khodakovsky, P. Alliez, M. Desbrun, and P. Schroder, Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes, Graphical Models, vol.64, issue.3-4, 2002.
DOI : 10.1006/gmod.2002.0575
URL : https://hal.archives-ouvertes.fr/inria-00072013

M. Kallmann and D. Thalmann, Star-Vertices: A Compact Representation for Planar Meshes with Adjacency Information, Journal of Graphics Tools, vol.5, issue.1, pp.7-18, 2002.
DOI : 10.1145/282918.282923

J. I. Munro and V. Raman, Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-776, 2001.
DOI : 10.1137/S0097539799364092

J. I. Munro, V. Raman, and A. J. Storm, Representing dynamic binary trees succintly, Proc. of SODA, pp.529-536, 2001.

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Proc. of ICALP, pp.1080-1094, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00159287

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

C. Touma and C. , Gotsman Triangle mesh compression, Graphics Interface, pp.26-34, 1998.

G. Turan, On the succinct representation of graphs, Discr. and Appl. Math, pp.289-294, 1984.
DOI : 10.1016/0166-218X(84)90126-4

W. Tutte, A census of planar triangulations, Journal canadien de math??matiques, vol.14, issue.0, pp.21-38, 1962.
DOI : 10.4153/CJM-1962-002-9

W. Tutte, A census of planar maps, Journal canadien de math??matiques, vol.15, issue.0, pp.249-271, 1963.
DOI : 10.4153/CJM-1963-029-x