Compact representations of separable graphs, SODA, pp.342-351, 2003. ,
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
Succinct representation of triangulations with a boundary, WADS, pp.134-145, 2005. ,
URL : https://hal.archives-ouvertes.fr/inria-00090707
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
Explicit array-based compact data structures for triangulations, pp.312-322, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00623762
ESQ: Editable SQuad Representation for Triangle Meshes. SIBGRAPI, pp.110-117 ,
URL : https://hal.archives-ouvertes.fr/hal-00731322
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
LR: compact connectivity representation for triangle meshes, In ACM Trans. Graph, vol.30, issue.4, p.67, 2011. ,
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
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
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
Embedding planar graphs on the grid, SODA, pp.138-148, 1990. ,