T. J. Alumbaugh and X. Jiao, Compact Array-Based Mesh Data Structures, Proc. of the 14th Intern. Meshing Roundtable (IMR), pp.485-503, 2005.
DOI : 10.1007/3-540-29090-7_29

J. Barbay, L. Castelli-aleardi, M. He, and J. I. Munro, Succinct representation of labeled graphs, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00712915

B. G. Baumgart, Winged-edge polyhedron representation, 1972.

B. G. Baumgart, A polyhedron representation for computer vision, Proceedings of the May 19-22, 1975, national computer conference and exposition on, AFIPS '75, pp.589-596, 1975.
DOI : 10.1145/1499949.1500071

D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman et al., Representing Trees of Higher Degree, Algorithmica, vol.43, issue.4, pp.275-292, 2005.
DOI : 10.1007/s00453-004-1146-6

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

E. Brehm, 3-orientations and Schnyder-three tree decompositions. Master's thesis, 2000.

S. Campagna, L. Kobbelt, and H. P. Seidel, Directed Edges???A Scalable Representation for Triangle Meshes, Journal of Graphics Tools, vol.22, issue.6, pp.1-12, 1999.
DOI : 10.1145/282918.282923

L. Castelli-aleardi, O. Devillers, and A. Mebarki, CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS, International Journal of Computational Geometry & Applications, vol.21, issue.04, pp.393-402, 2011.
DOI : 10.1142/S021819591100372X

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

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

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representations of planar maps, Theoretical Computer Science, vol.408, issue.2-3, pp.174-187, 2008.
DOI : 10.1016/j.tcs.2008.08.016

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

L. Castelli-aleardi and O. Devillers, Explicit Array-Based Compact Data Structures for Triangulations, 2011.
DOI : 10.1007/978-3-642-25591-5_33

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

L. Castelli-aleardi, E. Fusy, and T. Lewiner, Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding, Discrete & Computational Geometry, vol.15, issue.4, pp.489-516, 2009.
DOI : 10.1007/s00454-009-9169-z

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

H. De-fraysseix, P. Ossona, and . Mendez, On topological aspects of orientations, Discrete Mathematics, vol.229, issue.1-3, pp.57-72, 2001.
DOI : 10.1016/S0012-365X(00)00201-6

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

S. Felsner, Convex drawings of planar graphs and the order dimension of 3-polytopes. Order, pp.19-37, 2001.

L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.74-123, 1985.
DOI : 10.1145/800061.808751

T. Gurung, D. Laney, P. Lindstrom, and J. Rossignac, SQuad: Compact Representation for Triangle Meshes, Computer Graphics Forum, vol.24, issue.3, pp.355-364, 2011.
DOI : 10.1111/j.1467-8659.2011.01866.x

T. Gurung, M. Luffel, P. Lindstrom, and J. Rossignac, LR: compact connectivity representation for triangle meshes, In ACM Trans. Graph, vol.30, issue.4, p.67, 2011.

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

D. Poulalhon and G. Schaeffer, Optimal Coding and Sampling of Triangulations, Algorithmica, vol.46, issue.3-4, pp.505-527, 2006.
DOI : 10.1007/s00453-006-0114-8

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.473.5994

W. Schnyder, Embedding planar graphs on the grid, SODA, pp.138-148, 1990.

J. Snoeyink and B. Speckmann, Tripod: a minimalist data structure for embedded triangulations, Workshop on Comput. Graph Theory and Combinatorics, 1999.

K. Yamanaka and S. Nakano, A compact encoding of plane triangulations with efficient query supports, Information Processing Letters, vol.110, issue.18-19, pp.803-809, 2010.
DOI : 10.1016/j.ipl.2010.06.014