. Bibliographie, Alex 01] A. Alexandrescu. Modern C++ Design : Generic Programming and Design Patterns Applied, 2001.

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, Computer Graphics Forum, vol.20, issue.3, 2001.
DOI : 10.1111/1467-8659.00541

P. Alliez and C. Gotsman, Recent Advances in Compression of 3D Meshes Advances in Multiresolution for Geometric Modelling, pp.3-26, 2005.

L. Arge, G. S. Bordal, and R. Fagerberg, Handbook Of Data Structures And Applications, Chap. Cache-Oblivious Data Structures, Crc Computer and Information Science, 2004.

M. Attene, B. Falcidieno, M. Spagnuolo, and J. Rossignac, SwingWrapper, ACM Transactions on Graphics, vol.22, issue.4, pp.982-996, 2003.
DOI : 10.1145/944020.944022

C. L. Bajaj, V. Pascucci, and G. Zhuang, Single-resolution compression of arbitrary triangular meshes with properties, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), p.247, 1999.
DOI : 10.1109/DCC.1999.755674

B. G. Baumgart, Winged Edge Polyhedron Representation, 1972.

]. B. Baumgart, Geometric Modeling for Computer Vision, 1974.

]. B. Baumgart, Winged-Edge Polyhedron Representation for Computer Vision, National Computer Conference, 1975.

M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry Algorithms and Applications, 2000.

D. K. Blandford, G. E. Blelloch, D. E. Cardoze, and C. Kadow, COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, the 12th International Meshing Roundtable, pp.135-146, 2003.
DOI : 10.1142/S0218195905001580

D. K. Blandford, G. E. Blelloch, and I. A. Kash, Compact representations of separable graphs, the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.679-688, 2003.

D. K. Blandford, G. E. Blelloch, and I. A. Kash, An Experimental Analysis of a Compact Graph Representation, pp.49-61, 2004.

D. K. Blandford, G. E. Blelloch, D. E. Cardoze, and C. Kadow, COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, International Journal of Computational Geometry & Applications, vol.15, issue.01, pp.3-24, 2005.
DOI : 10.1142/S0218195905001580

D. K. Blandford, Compact Data Structures with Fast Queries, 2006.

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. A. Bondy, Graph Theory With Applications, 1976.
DOI : 10.1007/978-1-349-03521-2

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

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/282918.282923

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct Representation of Triangulations with a Boundary, Proceedings of Workshop on Algorithms And Data Structures (WADS), pp.134-145, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00090707

L. and C. Aleardi, Représentations Compactes de Structures de Données Géométriques, 2006.

L. Castelli-aleardi, O. Devillers, and A. Mebarki, 2D Triangulation Representation Using Stable Catalogs, Proceedings of the 18th Canadian Conference on Computational Geometry, pp.71-74, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00090631

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Optimal Succinct Representations of Planar Maps, SCG 06 : Proceedings of the 22nd ACM Symposium on Computational Geometry, pp.309-318, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00098669

L. Castelli-aleardi, O. Devillers, and A. Mebarki, Catalog-Based Representation of 2D Triangulations, International Journal on Computational Geometry and Applications, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00560400

J. Chen, Computational Geometry : Methods and Applications, 1996.

Y. Chiang, C. Lin, and H. Lu, Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing, SODA '01 : Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.506-515, 2001.

]. P. Chou and T. H. Meng, Vertex data compression through vector quantization, IEEE Transactions on Visualization and Computer Graphics, vol.8, issue.4, pp.373-382, 2002.
DOI : 10.1109/TVCG.2002.1044522

P. Cignoni, C. Montani, C. Rocchini, and R. Scopigno, External memory management and simplification of huge meshes, IEEE Transactions on Visualization and Computer Graphics, vol.9, issue.4, pp.525-537, 2003.
DOI : 10.1109/TVCG.2003.1260746

A. K. Cline and R. J. Renka, A storage-efficient method for construction of a Thiessen triangulation, Rocky Mountain Journal of Mathematics, vol.14, issue.1, pp.119-139, 1984.
DOI : 10.1216/RMJ-1984-14-1-119

D. Cohen-or, D. Levin, and O. Remez, Progressive Compression of Arbitrary Triangular Meshes, VIS '99 : Proceedings of the conference on Visualization '99, pp.67-72, 1999.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Elements of Information Theory. Wiley Series in Telecommunications and Signal Processing, 2001.

K. Crane, A Survey of Efficient Structures for Digital Geometry Processing " . A survey written for Michael Garland's digital geometry processing class, 2006.

M. Deering, Geometry compression, Proceedings of the 22nd annual conference on Computer graphics and interactive techniques , SIGGRAPH '95, pp.13-20, 1995.
DOI : 10.1145/218380.218391

O. Devillers, S. Pion, and M. Teillaud, Walking in a Triangulation, SCG '01 : Proceedings of the seventeenth annual symposium on Computational geometry, pp.106-114, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00344519

E. Danovaro, L. Floriani, P. Magillo, and N. Sokolovky, Encoding Level- Of-Detail Tetrahedral Meshes Advances in Multiresolution for Geometric Modelling, pp.89-100, 2005.

P. Elias, Universal Codeword Sets and Representations of the Integers " . Information Theory, IEEE Transactions on, vol.21, issue.2, pp.194-203, 1975.

A. Fabri, G. Giezeman, L. Kettner, S. Schirra, and S. Schönherr, On the Design of CGAL a Computational Geometry Algorithms Library " . Software -Practice and Experience, pp.1167-1202, 2000.

L. D. Floriani, L. Kobbelt, and E. Puppo, A Survey on Data Structures for Level-of-Detail Models
DOI : 10.1007/3-540-26808-1_3

E. Sabin, Advances in Multiresolution for Geometric Modelling, pp.49-74, 2005.

P. J. Frey and P. George, Mesh Generation : Application to Finite Elements, 2000.
DOI : 10.1002/9780470611166

]. P. Gandoin and O. Devillers, Progressive Lossless Compression of Arbitrary Simplicial Complexes, SIGGRAPH '02 : Proceedings of the 29th annual conference on Computer graphics and interactive techniques, pp.372-379, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00167216

M. Garland, A Multiresolution Representation for Massive Meshes, IEEE Transactions on Visualization and Computer Graphics, vol.11, issue.2, pp.139-148, 2005.

M. T. Goodrich and K. Ramaiyer, Handbook of Computational Geometry, Chap. Geometric Data Structures, pp.463-489, 2000.

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

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.221-234, 1983.
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

Y. Halbwachs and Ø. Hjelle, Generalized Maps in Geological Modeling: Object-Oriented Design of Topological Kernels, Lecture Notes in Computational Science and Engineering Bruaset, Are M, vol.10, pp.339-356, 1999.
DOI : 10.1007/978-3-642-57172-5_11

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

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

M. Daehlen, Triangulations and Applications (Mathematics and Visualization), 2006.

H. Hoppe, Progressive meshes, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques , SIGGRAPH '96, pp.99-108, 1996.
DOI : 10.1145/237170.237216

M. Isenburg, Triangle Fixer : Edge-based Connectivity Compression, EWCG'00 : Proceedings of the 16th European Workshop on Computational Geometry, pp.18-23, 2000.

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 P. Alliez, Compressing Hexahedral Volume Meshes, PG '02 : Proceedings of the 10th Pacific Conference on Computer Graphics and Applications, p.284, 2002.

M. Isenburg and P. Alliez, Compressing polygon mesh geometry with parallelogram prediction, IEEE Visualization, 2002. VIS 2002., 2002.
DOI : 10.1109/VISUAL.2002.1183768

M. Isenburg and P. Alliez, Compressing Hexahedral Volume Meshes

M. Isenburg and S. Gumhold, Out-of-core compression for gigantic polygon meshes, ACM Transactions on Graphics, vol.22, issue.3, pp.935-942, 2003.
DOI : 10.1145/882262.882366

M. Isenburg, P. Lindstrom, S. Gumhold, and J. Snoeyink, Large mesh simplification using processing sequences, IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, p.61, 2003.
DOI : 10.1109/VISUAL.2003.1250408

M. Isenburg and P. Lindstrom, Streaming Meshes, Proceedings of the 16th IEEE Visualization Conference, pp.23-28, 2005.

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

M. Isenburg and J. Snoeyink, Graph Coding and Connectivity Compression, Proceedings of the China-Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT) Nankai

M. Isenburg, P. Lindstrom, S. Gumhold, and J. Shewchuk, Streaming Compression of Tetrahedral Volume Meshes, GI '06 : Proceedings of Graphics Interface, pp.115-121, 2006.

M. Isenburg, Y. Liu, J. Shewchuk, and J. Snoeyink, Streaming Computation of Delaunay Triangulations, SIGGRAPH '06 : ACM SIGGRAPH 2006 Papers, pp.1049-1056, 2006.

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

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. Schröder, and W. Sweldens, Progressive geometry compression, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.271-278, 2000.
DOI : 10.1145/344779.344922
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.6437

A. Khodakovsky, P. Alliez, M. Desbrun, and P. Schröder, Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes, Graphical Models, vol.64, issue.3-4, pp.147-168, 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, Proceedings of the Canadian Conference on Computational Geometry, 1999.

C. Gotsman, Efficient Coding of Nontriangular Mesh Connectivity, Graph. Models, vol.63, issue.4, pp.263-275, 2001.

G. Lavoué, Compresson de surfaces, basée sur la subdivision inverse, pour la transmission bas débit et la visualisation progressive, 2005.

E. Lee and H. Ko, Vertex Data Compression for Triangular Meshes

H. Lee, P. Alliez, and M. Desbrun, Angle-Analyzer : A Triangle-Quad Mesh Codec, PG '00 : Proceedings of the 8th Pacific Conference on Computer Graphics and Applications, pp.225-383, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00072001

]. T. Lewi and . Lewiner, Mesh Compression from Geometry

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

J. Li and C. Kuo, A Dual Graph Approach to 3D Triangular Mesh Compression, ICIP 98 : Proceedings of International Conference on Image Processing, pp.891-894, 1998.

P. Lienhardt, -dimensional generalized maps, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, pp.228-236, 1989.
DOI : 10.1145/73833.73859
URL : https://hal.archives-ouvertes.fr/hal-00909382

P. Lindstrom, Out-of-core simplification of large polygonal models, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.259-262, 2000.
DOI : 10.1145/344779.344912

P. Lindstrom and C. T. Silva, A memory insensitive technique for large model simplification, Proceedings Visualization, 2001. VIS '01., pp.121-126, 2001.
DOI : 10.1109/VISUAL.2001.964502

H. Lopes, G. Tavares, J. Rossignac, A. Szymczak, and A. Safanova, Edgebreaker, Proceedings of the seventh ACM symposium on Solid modeling and applications , SMA '02, pp.289-296, 2002.
DOI : 10.1145/566282.566324

]. D. Mehta and S. Sahni, Handbook Of Data Structures And Applications, Chapman & Hall/Crc Computer and Information Science, vol.20043742, 2004.
DOI : 10.1201/9781420035179

D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra, Theoretical Computer Science, vol.7, issue.2, pp.217-236, 1978.
DOI : 10.1016/0304-3975(78)90051-8

D. R. Musser and A. Saini, The STL Tutorial and Reference Guide : C++ Programming with the Standard Template Library, 1995.

R. Pajarola and J. Rossignac, Compressed progressive meshes, IEEE Transactions on Visualization and Computer Graphics, vol.6, issue.1, pp.79-93, 2000.
DOI : 10.1109/2945.841122
URL : https://smartech.gatech.edu/bitstream/1853/3372/1/99-05.pdf

J. Peng, C. Kim, and C. C. Kuo, 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

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

S. Pion, De la géométrie algorithmique au calcul géométrique, 1999.

D. Poulalhon and G. Schaeffer, Optimal Coding and Sampling of Triangulations, Proceedings of Thirtieth International Colloquium on Automata, Languages and Programming, pp.1080-1094, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00159287

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

F. P. Preparata and M. I. Shamos, Computational geometry : an introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6

J. Rossignac, 3D Compression Made Simple : Edgebreaker with Zip&Wrap on a Corner-Table, Proceedings of the International Conference on Shape Modeling and Applications, pp.7-11, 2001.

J. Rossignac, 3D Mesh Compression, 2003.
DOI : 10.1016/B978-012387582-2/50020-4

]. J. Ross-03b, A. Rossignac, A. Safonova, and . Szymczak, Hierarchical and Geometrical Methods in Scientific Visualization, Chap. Edgebreaker on a Corner Table : A simple technique for representing and compressing triangulated surfaces, Mathematics and Visualization, pp.41-050, 2003.

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

J. Rossignac and A. Szymczak, Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker, Computational Geometry, vol.14, issue.1-3
DOI : 10.1016/S0925-7721(99)00028-0

W. Schnyder, Embedding Planar Graphs on the Grid, SODA '90 : Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pp.138-148, 1990.

J. R. Shewchuk, Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, Applied Computational Geometry : Towards Geometric Engineering From the First ACM Workshop on Applied Computational Geometry, pp.203-222, 1996.
DOI : 10.1007/BFb0014497

C. Silva, Y. Chiang, J. El-sana, and P. Lindstrom, Out-of-Core Algorithms for Scientific Visualization and Computer Graphics, IEEE Visualization conference'02 Course Notes, 2002.

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

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, Proceedings of the Graphics Interface 1998 Conference, pp.26-34, 1998.

G. T. Toussaint, Quadrangulations of planar sets, TRIANGLE : Mesh Generator and Delaunay Triangulator " . [Tura, vol.84, pp.218-227, 1995.
DOI : 10.1007/3-540-60220-8_64

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

J. S. Vitter, Algorithms and Data Structures for External Memory, Foundations and Trends?? in Theoretical Computer Science, vol.2, issue.4, pp.1-38, 1999.
DOI : 10.1561/0400000014

J. Wu, L. Kobbelt, and A. Peters, A Stream Algorithm for the Decimation of Massive Meshes, Graphics Interface, pp.185-192, 2003.

G. Zachmann and E. Langetepe, Geometric Data Structures for Computer Graphics, Proceedings of ACM SIGGRAPH, pp.27-31, 2003.