. Compression-de-la-géométrie, information constitue une partie très importante de l'information globale contenue dans un objet géométrique Une fois que nous avons montré comment il est possible de " compresser " et de réduire le coût de la connectivité d'un maillages (on est passé de plusieurs centaines de bits par sommetàsommetà 2.17 ou 1.62 bits par sommet dans le cas triangulaire ), il est temps de se concentrer sur l'information géométrique provenant des coordonnées des points dans l'espace : les quelques dizaines de bits par sommet nécessaires pour coder la géométrie ne sont plus négligeables. Dans ce cadre on part de l'observation que les coordonnées des sommets d'un maillage ne sont pascompì etement indépendantes entre elles, au moins dans la pratique : par exemple lorsqu'on considère des maillages approchant une surface lisse, on constate que les coordonnées d'un sommet sont assez proches de la moyenne des coordonnées de ses sommets voisins (sommets adjacents dans le maillage) Cette remarque a déjà conduitàconduità plusieurs stratégies de compression visantàvisantà mieux prédire et coder l'information géométriquè a partir de l'information combinatoire d'un maillage. Nous disposons déjà d'un ingrédient crucial, l'information de connectivité, ` a laquelle nos structures permettent d'accéder demanì ere efficace, sans la nécessité de décoder globalement la représentation de l'objet. L'idée de base serait de tirer profit de notre représentation hiérarchique d'un maillage afin d'adopter un repère local et une stratégie de prédiction pour coder la position de points avec des coordonnées locales, dont l'information géométrique est partagée par un nombre considérable de micro régions) et utiliser des coordonnées locales pour exprimer la position des autres sommets : ces coordonnées seraient relativesàrelativesà des repères locaux, chacun associéassociéà une micro région

]. O. Bibliographie and . Aichholzer, The path of a triangulation, Proc. 15th Ann, pp.14-23, 1999.

O. Aichholzer, T. Hackl, H. Krasser, C. Huemer, F. Hurtado et al., On the number of plane graphs, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.504-513, 2006.
DOI : 10.1145/1109557.1109613

P. Alliez and M. Desbrun, Progressive compression for lossless transmission of triangle meshes, Proceedings of the 28th annual conference on Computer graphics and interactive techniques , SIGGRAPH '01, pp.195-202, 2001.
DOI : 10.1145/383259.383281

P. Alliez and M. Desbrun, Valence-Driven Connectivity Encoding for 3D Meshes, Proceedings of Eurographics, pp.480-489, 2001.
DOI : 10.1111/1467-8659.00541
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.3212

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

C. Arndt, Information measures, 2001.
DOI : 10.1007/978-3-642-56669-1

R. Ash, Information Theory, 1990.

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

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

K. Daniel and . Blandford, Compact Data Structures with Fast Queries, 2006.

K. Daniel, G. E. Blandford, and . Blelloch, Dictionaries using variablelength keys and data, with applications, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1-10, 2005.

K. Daniel, G. E. Blandford, D. E. Blelloch, C. Cardoze, and . Kadow, Compact representations of simplicial meshes in two and three dimensions, Int. J. Comput. Geometry Appl, vol.15, issue.1, pp.3-24, 2005.

K. Daniel, G. E. Blandford, I. A. Blelloch, and . Kash, Compact representations of separable graphs, Proc. of the Annual ACM- SIAM Symp. on Discrete Algorithms (SODA), pp.342-351, 2003.

K. Daniel, G. E. Blandford, I. A. Blelloch, and . Kash, An experimental analysis of a compact graph representation, ALENEX/ANALC, pp.49-61, 2004.

J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, Triangulations in CGAL, Computational Geometry, vol.22, issue.1-3, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408

J. Boissonnat and M. Yvinec, Géométrie algorithmique, Ediscience Int, 1995.

N. Bonichon, C. Gavoille, and N. Hanusse, An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation, Proc. of 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.499-510, 2003.
DOI : 10.1007/3-540-36494-3_44
URL : https://hal.archives-ouvertes.fr/hal-00307599

N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer, Planar Graphs, via Well-Orderly Maps and Trees, Graphs and Combinatorics, vol.22, issue.2, pp.185-202, 2006.
DOI : 10.1007/s00373-006-0647-2
URL : https://hal.archives-ouvertes.fr/hal-00307603

N. Bonichon, C. Gavoille, and A. Labourel, Edge Partition of Toroidal Graphs into Forests in Linear Time, 7th International Conference on Graph Theory (ICGT), pp.421-425, 2005.
DOI : 10.1016/j.endm.2005.06.065
URL : https://hal.archives-ouvertes.fr/hal-00307600

N. Bonichon, Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux, 2002.

P. Bose and G. Toussaint, Characterizing and efficiently computing quadrangulations of planar point sets, Computer Aided Geometric Design, vol.14, issue.8, pp.763-785, 1997.
DOI : 10.1016/S0167-8396(97)00013-7

A. Brodnik, S. Carlsson, E. D. Demaine, J. I. Munro, and R. Sedgewick, Resizable Arrays in Optimal Time and Space, Proc. 6th Workshop on Algorhtms and Data Structures (WADS), volume 1663 of LNCS, pp.37-48, 1999.
DOI : 10.1007/3-540-48447-7_4

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 and O. Devillers, Canonical triangulation of a graph, with a coding application, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00070765

L. Castelli-aleardi, O. Devillers, and A. Mebarki, 2d triangulation representation using stable catalogs, Proc. of 18th Canadian Conference on Computational Geometry (CCCG), pp.71-74, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00090631

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Dynamic updates of succinct triangulations, Proc. of 17th Canadian Conference on Computational Geometry (CCCG), pp.135-138, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001187

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representation of triangulations with a boundary, Proc. 9th Workshop on Algorhtms and Data Structures (WADS), pp.134-145, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090707

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Optimal succinct representations of planar maps, Proc. of 22nd ACM Annual Symposium on Computational Geometry (SoCG), pp.309-318, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00098669

Y. Chiang, C. Lin, and H. Lu, Orderly spanning trees with applications to graph encoding and graph drawing. SODA, pp.506-515, 2001.
DOI : 10.1137/s0097539702411381
URL : http://arxiv.org/abs/cs/0102006

Y. Chiang, C. Lin, and H. Lu, Orderly Spanning Trees with Applications, SIAM Journal on Computing, vol.34, issue.4, pp.924-945, 2005.
DOI : 10.1137/S0097539702411381
URL : http://arxiv.org/abs/cs/0102006

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

D. R. Clark and J. I. Raman, Efficient suffix trees on secondary storage, Proc. of the 7th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.383-391, 2001.

S. Cook and R. Reckhow, Time bounded random access machines, Journal of Computer and System Sciences, vol.7, issue.4, pp.354-375, 1973.
DOI : 10.1016/S0022-0000(73)80029-7
URL : http://doi.org/10.1016/s0022-0000(73)80029-7

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry : Algorithms and Applications, 1997.

F. Hurtado, M. Noy, and J. Urrutia, Flipping Edges in Triangulations, Discrete & Computational Geometry, vol.22, issue.3, pp.333-346, 1999.
DOI : 10.1007/PL00009464

P. Flajolet and R. Sedgewick, Analytic combinatorics. Preliminary draft, 2004.
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

H. De-fraysseix, J. Pach, and R. Pollack, How to draw a planar graph on a grid, Combinatorica, vol.13, issue.1, pp.41-51, 1990.
DOI : 10.1007/BF02122694

M. L. Fredman and M. Saks, The cell probe complexity of dynamic data structures, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.345-354, 1989.
DOI : 10.1145/73007.73040

M. L. Fredman and D. E. Willard, Surpassing the information theoretic bound with fusion trees, Journal of Computer and System Sciences, vol.47, issue.3, pp.424-436, 1993.
DOI : 10.1016/0022-0000(93)90040-4

M. L. Fredman and D. E. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, Journal of Computer and System Sciences, vol.48, issue.3, pp.533-551, 1994.
DOI : 10.1016/S0022-0000(05)80064-9
URL : http://doi.org/10.1016/s0022-0000(05)80064-9

E. Fusy, D. Poulalhon, and G. Schaeffer, Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling, BIBLIOGRAPHIE Proc. of the 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.690-699, 2005.
DOI : 10.1145/1361192.1361196
URL : https://hal.archives-ouvertes.fr/hal-00330580

P. Gandoin, Compression progressive et sans perte de structures géométriques, 2001.

P. Gandoin and O. Devillers, Progressive lossless compression of arbitrary simplicial complexes, ACM Trans. Graph, vol.21, issue.3, pp.372-379, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00167216

R. Geary, R. Raman, and V. Raman, Succinct ordinal trees with levelancestor queries, Proc. of the 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.1-10, 2004.

R. F. Geary, N. Rahman, R. Raman, and V. Raman, A simple optimal representation for balanced parentheses, Combinatorial Pattern Matching, 15th Annual Symposium (CPM), pp.159-172, 2004.

R. González, S. Grabowski, V. Mäkinen, and G. Navarro, Practical implementation of rank and select queries, Poster in Proc. of 4th Intern. Workshop on Efficient and Experimental Algorithms (WEA), 2005.

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

C. Gotsman, S. Gumhold, and L. Kobbelt, Simplification and Compression of 3D Meshes, Proc. of the European Summer School on Principles of Multiresolution in Geometric Modelling, 2001.
DOI : 10.1007/978-3-662-04388-2_12

I. P. Goulden and D. M. Jackson, Combinatorial enumeration, 2004.

S. Gumhold, Mesh Compression, 2000.

S. Gumhold, Optimizing markov models with applications to triangular connectivity coding, Proceedings of the 16th Annual ACM- SIAM Symposium on Discrete Algorithms (SODA), pp.331-338, 2005.

S. Gumhold, S. Guthe, and W. Straßer, Tetrahedral mesh compression with the cut-border machine, Proceedings Visualization '99 (Cat. No.99CB37067), pp.51-58, 1999.
DOI : 10.1109/VISUAL.1999.809868

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

T. Hagerup, P. B. Miltersen, and R. Pagh, Deterministic Dictionaries, Journal of Algorithms, vol.41, issue.1, pp.69-85, 2001.
DOI : 10.1006/jagm.2001.1171
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.144

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

X. He, M. Kao, and H. Lu, A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs, SIAM Journal on Computing, vol.30, issue.3, pp.838-846, 2000.
DOI : 10.1137/S0097539799359117

E. Heighway, A mesh generator for automatically subdividing irregular polygons into quadrilaterals, IEEE Transactions on Magnetics, vol.19, issue.6, pp.2535-2538, 1983.
DOI : 10.1109/TMAG.1983.1062810

P. G. Howard and J. S. Vitter, Analysis of arithmetic coding for data compression. Information processing and Management, pp.749-763, 1992.

D. A. Huffman, A method for the construction of minimum-redudancy codes, Proc. Inst. Radio Eng, pp.1098-1101, 1952.

F. Hurtado and M. Noy, Graph of triangulations of a convex polygon and tree of triangulations, Computational Geometry, vol.13, issue.3, pp.179-188, 1999.
DOI : 10.1016/S0925-7721(99)00016-4

M. Isenburg, Compressing polygon mesh connectivity with degree duality prediction, Graphics Interface'02 Conference Proceedings, pp.161-170, 2002.
DOI : 10.1109/visual.2002.1183768

M. Isenburg, Compression and Streaming of Polygon Meshes, 2005.

M. Isenburg and P. Alliez, Compressing hexahedral volume meshes, Graphical Models, vol.65, issue.4, pp.239-257, 2003.
DOI : 10.1016/S1524-0703(03)00044-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3225

M. Isenburg and P. Lindstrom, Streaming meshes, 16th IEEE Visualization Conference (VIS 2005), pp.231-238, 2005.
DOI : 10.1109/vis.2005.94

M. Isenburg, P. Lindstrom, and J. Snoeyink, Streaming compression of triangle meshes, ACM SIGGRAPH 2005 Sketches on , SIGGRAPH '05, pp.111-118, 2005.
DOI : 10.1145/1187112.1187276

M. Isenburg and J. Snoeyink, Mesh collapse compression, Symposium on Computational Geometry, pp.419-420, 1999.
DOI : 10.1109/sibgra.1999.805604
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9302

M. Isenburg and J. Snoeyink, Face fixer, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.263-270, 2000.
DOI : 10.1145/344779.344919

M. Isenburg and J. Snoeyink, Spirale Reversi: Reverse decoding of the Edgebreaker encoding, Computational Geometry, vol.20, issue.1-2, pp.39-52, 2001.
DOI : 10.1016/S0925-7721(01)00034-7

M. Isenburg and J. Snoeyink, Graph coding and connectivity compression, 2004.

M. Isenburg and J. Snoeyink, On the non-redundancy of split offsets in degree coding, 2005.

M. Isenburg and J. Snoeyink, Early-split coding of triangle mesh connectivity, Graphics Interface 06, pp.89-97, 2006.

A. Itai, M. Rodeh, and G. Jacobson, Representation of graphs, Proceedings of the IEEE Symposium on Foundations of Computerb Science (FOCS), pp.215-219, 1982.
DOI : 10.1007/BF00288971

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

G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica, vol.46, issue.1, pp.4-32, 1996.
DOI : 10.1007/BF02086606

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

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

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

D. King and J. Rossignac, Guaranteed 3.67v bit encoding of planar triangle graphs, 11th Canad. Conf. on Computational Geometry, pp.146-149, 1999.

D. Knuth, The art of computer programming. Preliminary draft, 2004.

B. Kronrod and C. Gotsman, Efficient Coding of Nontriangular Mesh Connectivity, Graphical Models, vol.63, issue.4, pp.263-275, 2001.
DOI : 10.1006/gmod.2001.0555

T. Lewiner, M. Craizer, H. Lopes, S. Pesco, L. Velho et al., Gencode : geometry-driven compression in arbitrary dimension and codimension, 18th Brazilian Symposium on Computer Graphics and Image ProcessingSIBGRAPI 2005), pp.249-256, 2005.

T. Lewiner, M. Craizer, H. Lopes, S. Pesco, L. Velho et al., GEncode: Geometry-driven compression for General Meshes, 19th Brazilian Symposium on Computer Graphics and Image Processing, p.page to appear, 2006.
DOI : 10.1007/s00371-003-0217-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.8431

T. Lewiner, Mesh Compression from Geometry, 2005.
URL : https://hal.archives-ouvertes.fr/tel-00338771

T. Lewiner, H. Lopes, J. Rossignac, and A. W. Vieira, Efficient Edgebreaker for surfaces of arbitrary topology, Proceedings. 17th Brazilian Symposium on Computer Graphics and Image Processing, pp.218-225, 2004.
DOI : 10.1109/SIBGRA.2004.1352964

M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, 1997.

R. J. Lipton and R. E. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics, vol.36, issue.2, pp.177-189, 1979.
DOI : 10.1137/0136016

H. Lopes, J. Rossignac, A. Safonova, A. Szymczak, and G. Tavares, Edgebreaker: a simple implementation for surfaces with handles, Computers & Graphics, vol.27, issue.4, pp.553-567, 2003.
DOI : 10.1016/S0097-8493(03)00102-X

H. Lu, Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits, SODA, pp.223-224, 2002.
DOI : 10.1137/120879142

L. Gary, . Miller, W. P. Shang-hua-teng, S. A. Thurston, and . Vavasis, Separators for sphere-packings and nearest neighbor graphs

L. Gary, W. P. Miller, and . Thurston, Separators in two and three dimensions, Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing (STOC), pp.300-309, 1990.

R. C. Mullin, On counting rooted triangular maps. Canad, J. Math, vol.17, pp.373-382, 1965.
DOI : 10.4153/cjm-1965-038-x

J. I. Munro, V. Raman, and A. J. Storm, Representing dynamic binary trees succintly, Proc. of the Twelfth ACM-SIAM Annual Symposium on Discrete Algorithms (SODA), pp.529-536, 2001.

J. , I. Munro, R. Raman, V. Raman, S. Srinivasa et al., Succinct representations of permutations, Automata, Languages and Programming, 30th International Colloquium (ICALP), pp.345-356, 2003.

J. , I. Munro, and V. Raman, Succinct representation of balanced parentheses and static trees, SIAM J. Comput, vol.31, issue.3, pp.762-776, 2001.

J. , I. Munro, V. Raman, S. Srinivasa, and . Rao, Space efficient suffix trees, J. Algorithms, vol.39, issue.2, pp.205-222, 2001.
DOI : 10.1007/978-3-540-49382-2_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5337

J. Petersen, Die Theorie der regul??ren graphs, Acta Mathematica, vol.15, issue.0, pp.193-220, 1891.
DOI : 10.1007/BF02392606

D. Poulalhon and G. Schaeffer, Optimal coding and sampling of triangulations, Proc. of Automata, Languages and Programming, 30th International Colloquium (ICALP), pp.1080-1094, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00159287

D. Poulalhon, Probì emesénumératifsemesénumératifs autour des cartes combinatoires et des factorisations dans le groupe symétrique, 2002.

S. Prat, P. Gioia, Y. Bertrand, and D. Meneveaux, Connectivity compression in an arbitrary dimension. The Visual Computer, pp.8-10876, 2005.

W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, R. Raman et al., Numerical Recipes in C : The Art of Scientific Computing Succint indexable dictionaries with application to encoding k-ary trees and multisets, SODA, pp.233-242, 2002.

R. Raman and S. S. Rao, Static Dictionaries Supporting Rank, Algorithms and Computation, 10th International Symposium (ISAAC), volume 1741 of LNCS, pp.18-26, 1999.
DOI : 10.1007/3-540-46632-0_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1749

R. Raman, V. Raman, S. Srinivasa, and . Rao, Succinct Dynamic Data Structures, Algorithms and Data Structures, 7th International Workshop (WADS), volume 2125 of LNCS, pp.426-437
DOI : 10.1007/3-540-44634-6_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7831

V. Raman and S. S. Rao, Succint dynamic dictionaries and trees, Proc. of Automata, Languages and Programming, 30th International Colloquium (ICALP), pp.357-366, 2003.
DOI : 10.1007/3-540-45061-0_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.537.3741

S. Ramaswami, P. A. Ramos, and G. Toussaint, Converting triangulations to quadrangulations, Computational Geometry, vol.9, issue.4, pp.257-276, 1998.
DOI : 10.1016/S0925-7721(97)00019-9

J. Rissanen, Generalized Kraft Inequality and Arithmetic Coding, IBM Journal of Research and Development, vol.20, issue.3, pp.198-203, 1976.
DOI : 10.1147/rd.203.0198

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

K. Sadakane and R. Grossi, Squeezing succinct data structures into entropy bounds, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.1230-1239, 2006.
DOI : 10.1145/1109557.1109693

D. Salomon, Data compression : the complete reference, 2000.

F. Santos and R. Seidel, A better upper bound on the number of triangulations of a planar point set, Journal of Combinatorial Theory, Series A, vol.102, issue.1, pp.186-193, 2003.
DOI : 10.1016/S0097-3165(03)00002-5

G. Schaeffer, Conjugaison d'arbres et cartes combinatoires aléatoires, 1998.

W. Schnyder, Embedding planar graphs on the grid, Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.138-148, 1990.

C. E. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

M. Sharir and E. Welzl, Random triangulations of planar point sets, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, p.0, 2006.
DOI : 10.1145/1137856.1137898

A. Szymczak, D. King, and J. Rossignac, An Edgebreaker-based efficient compression scheme for regular meshes, Computational Geometry, vol.20, issue.1-2, pp.53-68, 2001.
DOI : 10.1016/S0925-7721(01)00035-9

A. Szymczak and J. Rossignac, Grow & fold: compressing the connectivity of tetrahedral meshes, Computer-Aided Design, vol.32, issue.8-9, pp.527-537, 2000.
DOI : 10.1016/S0010-4485(00)00040-3

G. Taubin and J. Rossignac, Geometric compression through topological surgery, ACM Transactions on Graphics, vol.17, issue.2, pp.84-115, 1998.
DOI : 10.1145/274363.274365
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1529

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

G. Toussaint, Quadrangulations of planar sets, Proc. 9th Workshop on Algorhtms and Data Structures (WADS), pp.218-227, 1995.
DOI : 10.1007/3-540-60220-8_64

W. Trotter and J. Moore, Some theorems on graphs and posets, Discrete Mathematics, vol.15, issue.1, pp.79-84, 1976.
DOI : 10.1016/0012-365X(76)90111-4
URL : http://doi.org/10.1016/0012-365x(76)90111-4

W. Trotter and J. Moore, The dimension of planar posets, Journal of Combinatorial Theory, Series B, vol.22, issue.1, pp.54-67, 1977.
DOI : 10.1016/0095-8956(77)90048-X

W. T. Trotter, Combinatorics and partially ordered sets, 1992.

G. Turan, On the succinct representation of graphs, Discrete Applied Mathematics, vol.8, issue.3, 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

I. H. Witten, R. M. Neal, and J. G. Cleary, Arithmetic coding for data compression, Communications of the ACM, vol.30, issue.6, pp.520-540, 1987.
DOI : 10.1145/214762.214771

M. Yannakakis, Four pages are necessary and sufficient for planar graphs, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.104-108, 1986.
DOI : 10.1145/12130.12141

G. M. Ziegler, Lectures on Polytopes, 1995.
DOI : 10.1007/978-1-4613-8431-1

J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.337-343, 1977.
DOI : 10.1109/TIT.1977.1055714

J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory, vol.24, issue.5, pp.530-536, 1978.
DOI : 10.1109/TIT.1978.1055934