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

J. Tyler, X. Alumbaugh, and . Jiao, Compact array-based mesh data structures, Proceedings of the 14th International Meshing Roundtable, pp.485-503, 2005.

G. Bruce, D. Baumgart, and . Document, Winged edge polyhedron representation URL: http://www.dtic.mil/cgi-bin/GetTRDoc?Location=U2&doc= GetTRDoc, p.755141, 1972.

G. Bruce and . Baumgart, A polyhedron representation for computer vision, Proceedings National Computer Conference and Exposition, pp.589-596, 1975.

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

URL : http://db.uwaterloo.ca/~eddemain/papers/MaryTrees_Algorithmica/paper.pdf

O. Bernardi and N. Bonichon, Intervals in Catalan lattices and realizers of triangulations, Journal of Combinatorial Theory, Series A, vol.116, issue.1, pp.55-75, 2009.
DOI : 10.1016/j.jcta.2008.05.005

D. Blanford, G. Blelloch, and I. Kash, Compact representations of separable graphs URL: https, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.679-688, 2003.

J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, Triangulations in CGAL Computational Geometry: Theory & Applications URL: https, pp.5-19, 2002.

E. Brehm, 3-orientations and Schnyder 3-tree-decompositions, 2000.

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

URL : http://www9.informatik.uni-erlangen.de/Persons/Campagna/papers/dedge.ps.gz

L. Castelli, A. , and O. Devillers, Explicit Array-Based Compact Data Structures for Triangulations, Research Report, vol.110, issue.3
DOI : 10.1016/j.ipl.2010.06.014

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

O. Luca-castelli-aleardi, A. Devillers, and . Mebarki, CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS, International Journal of Computational Geometry & Applications, vol.21, issue.04, pp.393-402, 2011.
DOI : 10.1016/S0925-7721(97)00019-9

O. Luca-castelli-aleardi, J. Devillers, and . Rossignac, ESQ: editable squad representation for triangle meshes, 25th Conference on Graphics, Patterns and Images, SIBGRAPI 2012, pp.110-117, 2012.

O. Luca-castelli-aleardi, J. Devillers, and . Rossignac, Triangulation data structures, Encyclopedia of Algorithms, pp.2262-2267978, 2016.

O. Luca-castelli-aleardi, G. Devillers, and . Schaeffer, Succinct Representation of Triangulations with a Boundary, Proc. 9th Workshop on Algorithms and Data Structures, pp.134-135, 2005.
DOI : 10.1007/11534273_13

O. Luca-castelli-aleardi, G. Devillers, and . 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

É. Luca-castelli-aleardi, T. Fusy, and . 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.4153/CJM-1963-029-x

R. Chih-nan-chuang, A. Garg, X. He, M. Kao, and H. Lu, Compact encodings of planar graphs via canonical orderings and multiple parentheses, Automata, Languages and Programming, pp.118-12910, 1998.
DOI : 10.1007/BFb0055046

H. De, F. , P. Ossona, and . Mendez, On topological aspects of orientations, Discrete Mathematics, vol.229, issue.100, pp.57-7210, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00005628

V. Despré, D. Gonçalves, and B. Lévêque, Encoding toroidal triangulations. Discrete & Computational Geometry URL: https://doi.org/10, pp.507-544, 1007.

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

D. Gonçalves and B. Lévêque, Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations, Discrete & Computational Geometry, vol.5, issue.1, pp.67-131, 2014.
DOI : 10.1007/BF00353652

C. Gotsman, On the Optimality of Valence-based Connectivity Coding, Computer Graphics Forum, vol.46, issue.1, pp.99-102, 2003.
DOI : 10.1006/gmod.2001.0555

L. 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

S. Gumhold and W. Straßer, Real time compression of triangle mesh connectivity, Proceedings of the 25th annual conference on Computer graphics and interactive techniques , SIGGRAPH '98, pp.133-140, 1998.
DOI : 10.1145/280814.280836

URL : http://www.cs.utah.edu/~sgumhold/Finals/tglMeshCompLetter.pdf

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.1145/1073204.1073278

URL : http://www.cc.gatech.edu/grads/t/topraj/EG11files/squad.pdf

T. Gurung, M. Luffel, P. Lindstrom, and J. Rossignac, LR: compact connectivity representation for triangle meshes, ACM transactions on graphics, vol.30, issue.4, pp.2011-2021, 1964962.
DOI : 10.1111/j.1467-8659.2011.01866.x

URL : http://www.cc.gatech.edu/grads/t/topraj/EG11files/squad.pdf

T. Gurung, M. Luffel, P. Lindstrom, and J. Rossignac, Zipper: A compact connectivity data structure for triangle meshes, Computer-Aided Design, vol.45, issue.2, pp.262-269, 2013.
DOI : 10.1016/j.cad.2012.10.009

X. He, M. Kao, and H. Lu, Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.317-325, 1999.
DOI : 10.1137/S0895480197325031

URL : http://arxiv.org/pdf/cs/0101033

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, 2001.
DOI : 10.1109/MCG.1985.276271

L. Kettner, Using generic programming for designing a data structure for polyhedral surfaces, Computational Geometry, vol.13, issue.1, pp.65-90, 1016.
DOI : 10.1016/S0925-7721(99)00007-3

URL : https://doi.org/10.1016/s0925-7721(99)00007-3

G. Stephen and . Kobourov, Canonical orders and schnyder realizers, Encyclopedia of Algorithms, pp.277-283, 2016.

A. Valery and . Liskovets, A pattern of asymptotic vertex valency distributions in planar maps URL: https, J. Comb. Theory, Ser. B, vol.75, issue.1, pp.116-133, 1999.

M. Luffel, T. Gurung, P. Lindstrom, and J. Rossignac, Grouper: A Compact, Streamable Triangle Mesh Data Structure, IEEE Transactions on Visualization and Computer Graphics, vol.20, issue.1, pp.84-98, 2014.
DOI : 10.1109/TVCG.2013.81

A. Maglo, G. Lavoué, F. Dupont, and C. Hudelot, 3D Mesh Compression, ACM Computing Surveys, vol.47, issue.3, pp.1-7, 2015.
DOI : 10.1002/cav.410

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

J. Ian, M. , and V. Raman, Succinct representation of balanced parentheses and static trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-77610, 2001.

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Algorithmica, vol.46, pp.3-4505, 2006.
DOI : 10.1007/s00453-006-0114-8

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

J. Rossignac and . Edgebreaker, Connectivity compression for triangle meshes. Visualization and Computer Graphics, IEEE Transactions on, vol.5, issue.1, pp.47-61, 1999.

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp.138-148, 1990.

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

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

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