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
Winged-edge polyhedron representation, Stanford, Tech. Rep, 1972. ,
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
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
Software for C 1 surface interpolation, Math. Software III, pp.161-194, 1977. ,
THE DELAUNAY HIERARCHY, International Journal of Foundations of Computer Science, vol.13, issue.02, pp.163-180, 2002. ,
DOI : 10.1142/S0129054102001035
URL : https://hal.archives-ouvertes.fr/inria-00166711
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
Efficient edgebreaker for surfaces of arbitrary topology, Sibgrapi, pp.218-225, 2004. ,
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
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
Compact Array-Based Mesh Data Structures, Proc. of 14th Int. Meshing Roundtable (IMR), pp.485-503, 2005. ,
DOI : 10.1007/3-540-29090-7_29
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
Explicit array-based compact data structures for triangulations, Proc. 22th Ann. Internat. Sympos. Algorithms Comput., ser. LNCS, pp.312-322, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00623762
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.2050
LR: compact connectivity representation for triangle meshes, ACM Trans. Graph, vol.30, issue.4, p.67, 2011. ,
CHF: A Scalable Topological Data Structure for Tetrahedral Meshes, XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05), pp.349-356, 2005. ,
DOI : 10.1109/SIBGRAPI.2005.18
Tripod: a minimalist data structure for embedded triangulations, Workshop on Comput. Graph Theory and Combinatorics, 1999. ,
Embedding planar graphs on the grid, SODA, pp.138-148, 1990. ,
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
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
Resizable Arrays in Optimal Time and Space, WADS, pp.37-48, 1999. ,
DOI : 10.1007/3-540-48447-7_4
Succint dynamic dictionaries and trees, 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