A. Schmidt, F. Lafarge, C. Brenner, F. Rottensteiner, and C. Heipke, Forest point processes for the automatic extraction of networks in raster data, ISPRS Journal of Photogrammetry and Remote Sensing, vol.126, pp.38-55, 2017.
DOI : 10.1016/j.isprsjprs.2017.01.012
URL : https://hal.archives-ouvertes.fr/hal-01469514

L. Castanié, B. Lévy, F. Bosquet, and . Volumeexplorer, Roaming large volumes to couple visualization and data processing for oil and gas exploration, 2005.

B. Dalstein, R. Ronfard, and M. Van-de-panne, Vector graphics complexes, ACM Transactions on Graphics, vol.33, issue.4, pp.1-13312, 2014.
DOI : 10.1111/j.1467-8659.2009.01630.x
URL : https://hal.archives-ouvertes.fr/hal-00983262

T. Kwok, Y. Chen, and C. Wang, Geometric analysis and computation using layered depth-normal images for three-dimensional microfabrication Three-Dimensional Microfabrication Using Two-photon Polymerization. Micro and Nano Technologies, pp.119-147

B. Baumgart, Winged-edge polyhedron representation, Tech. Rep, 1972.
DOI : 10.21236/AD0755141

M. Mäntylä, An Introduction to Solid Modeling, 1988.

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

H. Samet, Connected Component Labeling Using Quadtrees, Journal of the ACM, vol.28, issue.3, pp.487-501, 1981.
DOI : 10.1145/322261.322267

M. Benouamer and D. Michelucci, Bridging the gap between CSG and Brep via a triple ray representation, Proceedings of the fourth ACM symposium on Solid modeling and applications , SMA '97, pp.68-79, 1997.
DOI : 10.1145/267734.267755

A. Szymczak, J. Rossignac, and D. King, Piecewise Regular Meshes: Construction and Compression, Graphical Models, vol.64, issue.3-4, pp.183-198, 2002.
DOI : 10.1006/gmod.2002.0577

T. Ju, F. Losasso, S. Schaefer, and J. Warren, Dual contouring of Hermite data, ACM Trans Graph, vol.21, issue.3, pp.339-346, 2002.

G. Damiand and J. Rossignac, Rasterized Planar Face Complex, Computer-Aided Design, vol.90, pp.146-156, 2017.
DOI : 10.1016/j.cad.2017.05.010
URL : https://hal.archives-ouvertes.fr/hal-01578921

P. Lienhardt, N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.275-324, 1994.
DOI : 10.1142/S0218195994000173

D. Dobkin and M. Laszlo, Primitives for the manipulation of threedimensional subdivisions, Proceedings of the Third Annual Symposium on Computational Geometry. SCG '87, pp.86-99, 1987.

C. Aleardi, L. Devillers, O. Schaeffer, and G. , 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

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.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, 1999.
DOI : 10.1016/S0925-7721(99)00007-3

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

D. Sieger and M. Botsch, Design, implementation, and evaluation of the surface mesh data structure, Proceedings of the 20th International Meshing Roundtable, pp.533-550, 2012.

M. Botsch, L. Kobbelt, M. Pauly, P. Alliez, and B. Lévy, Polygon Mesh Processing. AK, 2010.

G. Damiand and P. Lienhardt, Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing. A K Peters, 2014.
DOI : 10.1201/b17403
URL : https://hal.archives-ouvertes.fr/hal-01090890

D. Nehab and H. Hoppe, Random-access rendering of general vector graphics, ACM Trans Graph, vol.27135, issue.5, pp.1-13510, 2008.
DOI : 10.1145/1457515.1409088
URL : http://research.microsoft.com/~hoppe/ravg.pdf

J. Shade, S. Gortler, . He, . Lw, and R. Szeliski, Layered depth images, Proceedings of the 25th annual conference on Computer graphics and interactive techniques , SIGGRAPH '98, pp.231-242, 1998.
DOI : 10.1145/280814.280882
URL : https://dash.harvard.edu/bitstream/handle/1/2640599/Gortler_LayeredDepth.pdf?sequence=2

G. Blelloch and A. Farzan, Succinct Representations of Separable Graphs, pp.138-150
DOI : 10.1007/978-3-642-13509-5_13
URL : http://www.cs.cmu.edu/~guyb/papers/BF10.pdf

D. Blandford, . Blelloch, . Ge, . Cardoze, . De et al., COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, International Journal of Computational Geometry & Applications, vol.21, issue.01, pp.3-24, 2005.
DOI : 10.1007/PL00008262

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-12, 1999.
DOI : 10.1145/258734.258863
URL : http://www9.informatik.uni-erlangen.de/Persons/Campagna/papers/dedge.ps.gz

C. Aleardi, L. Devillers, O. Mebarki, and A. , 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
URL : https://hal.archives-ouvertes.fr/inria-00560400

C. Aleardi, L. Devillers, and O. , Explicit array-based compact data structures for triangulations, Proc. 22th Ann. Internat. Sympos, pp.312-322, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00678615

T. Gurung, . Laney, . De, 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, J. Rossignac, and . Lr, Compact connectivity representation for triangle meshes, ACM Transactions on Graphics (TOG), vol.3067, issue.4, pp.1-67, 2011.
DOI : 10.1111/j.1467-8659.2011.01866.x
URL : http://www.cc.gatech.edu/grads/t/topraj/EG11files/squad.pdf

K. Yamanaka and S. Nakano, A compact encoding of plane triangulations with efficient query supports, Inf Process Lett, vol.110, pp.18-19803, 2010.
DOI : 10.1016/j.ipl.2010.06.014
URL : https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/48327/1/03.yamanaka.pdf

M. Luffel, T. Gurung, P. Lindstrom, J. Rossignac, and . Grouper, A compact , streamable triangle mesh data structure. Visualization and Computer Graphics, IEEE Transactions on, vol.20, issue.1, pp.84-98, 2014.
DOI : 10.1109/tvcg.2013.81

U. Bischoff and J. Rossignac, TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes, Data Compression Conference, pp.93-102, 2005.
DOI : 10.1109/DCC.2005.85

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
URL : http://www.cc.gatech.edu/~jarek/papers/Zipper.pdf

D. Ayala, P. Brunet, R. Juan, and I. Navazo, Object representation by means of nonminimal division quadtrees and octrees, ACM Transactions on Graphics, vol.4, issue.1, pp.41-59, 1985.
DOI : 10.1145/3973.3975

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

D. Floriani, L. Marzano, P. Puppo, and E. , Multiresolution models for topographic surface description. The Visual, Computer, vol.12, issue.7, pp.317-345, 1996.
DOI : 10.1007/s003710050068
URL : http://www.disi.unige.it/ftp/person/MagilloP/PS/VISUAL-C96.ps

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

S. Lefebvre and H. Hoppe, Compressed random-access trees for spatially coherent data EGSR'07; Aire-la-Ville, Switzerland, Switzerland: Eurographics Association, Proceedings of the 18th Eurographics Conference on Rendering Techniques, pp.339-349, 2007.

R. Finkel and J. Bentley, Quad trees a data structure for retrieval on composite keys, Acta Informatica, vol.4, issue.1, pp.1-9, 1974.
DOI : 10.1007/BF00288933

J. Orenstein, Multidimensional tries used for associative searching, Information Processing Letters, vol.14, issue.4, pp.150-157, 1982.
DOI : 10.1016/0020-0190(82)90027-8

M. Shneier, Two hierarchical linear feature representations: Edge pyramids and edge quadtrees, Computer Graphics and Image Processing, vol.17, issue.3, pp.211-224, 1981.
DOI : 10.1016/0146-664X(81)90002-2

M. Tamminen and R. Sulonen, The excell method for efficient geometric access to data, Proceedings of the 19th Design Automation Conference . DAC '82, pp.345-351, 1982.

R. Webber and H. Samet, On encoding boundaries with quadtrees, IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.6, pp.365-369, 1984.

G. Hunter and K. Steiglitz, Operations on Images Using Quad Trees, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.1, issue.2, pp.145-153, 1979.
DOI : 10.1109/TPAMI.1979.4766900

H. Samet and R. Webber, Storing a collection of polygons using quadtrees, ACM Transactions on Graphics, vol.4, issue.3, pp.182-222, 1985.
DOI : 10.1145/282957.282966

H. Samet, Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling), 2005.

I. Gargantini, An effective way to represent quadtrees, Communications of the ACM, vol.25, issue.12, pp.905-910, 1982.
DOI : 10.1145/358728.358741

H. Samet, An overview of quadtrees, octrees, and related hierarchical data structures Theoretical Foundations of Computer Graphics and CAD, pp.51-68, 1988.