Compact representation of triangulations, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00070574
Recent Advances in Compression of 3D Meshes, Advances in Multiresolution for Geometric Modelling, pp.3-26, 2005. ,
DOI : 10.1007/3-540-26808-1_1
URL : https://hal.archives-ouvertes.fr/inria-00071613
Compact representations of separable graphs, Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithms, pp.342-351, 2003. ,
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
Orderly spanning trees with applications to graph encoding and graph drawing. SODA, pp.506-515, 2001. ,
Compact encodings of planar graphs via canonical orderings and multiple parentheses, Automata, Laguages and Programming, pp.118-129, 1998. ,
DOI : 10.1007/BFb0055046
Efficient suffix trees on secondary storage, SODA, pp.383-391, 1996. ,
Space-efficient static trees and graphs, 30th Annual Symposium on Foundations of Computer Science, pp.549-554, 1989. ,
DOI : 10.1109/SFCS.1989.63533
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
Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-776, 2001. ,
DOI : 10.1137/S0097539799364092
Representing dynamic binary trees succintly, SODA, pp.529-536, 2001. ,
Optimal coding and sampling of triangulations, Proc. Intern. Colloqium ICALP'03, pp.1080-1094, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00159287
Succint indexable dictionaries with application to encoding k-ary trees and multisets, SODA, pp.233-242, 2002. ,
Static Dictionaries Supporting Rank, ISAAC, 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