M. H. Austern, Generic Programming and the STL, Nef polyhedra : A brief introduction. Computing Suppl, pp.43-60, 1995.

J. Boissonnat, O. Devillers, S. Pion, M. Teillaud, and M. Yvinec, Triangulations in CGAL, Triangulations in CGAL, pp.5-19, 2002.
DOI : 10.1016/S0925-7721(01)00054-2
URL : https://hal.archives-ouvertes.fr/hal-01179408

J. Boissonnat and S. Oudot, Provably good sampling and meshing of surfaces, Graphical Models, vol.67, issue.5, pp.405-451, 2005.
DOI : 10.1016/j.gmod.2005.01.004
URL : https://hal.archives-ouvertes.fr/hal-00488829

M. Caroli, V. Fisikopoulos, and M. Teillaud, Meshing of triply-periodic surfaces in CGAL. Poster presentation, Seventh International Conference on Curves and Surfaces, 2010.

M. Caroli and M. Teillaud, Computing 3D Periodic Triangulations, 17th European Symposium on Algorithms, pp.37-48, 2009.
DOI : 10.1007/978-3-642-04128-0_6
URL : https://hal.archives-ouvertes.fr/inria-00356871

M. Caroli and M. Teillaud, Delaunay triangulations of point sets in closed euclidean d-manifolds, Proceedings of the 27th annual ACM symposium on Computational geometry, SoCG '11, pp.101-104, 2010.
DOI : 10.1145/1998196.1998236
URL : https://hal.archives-ouvertes.fr/hal-01101094

G. Damiand, Contributions aux Cartes Combinatoires et Cartes Généralisées : Simplification, Modèles, Invariants Topologiques et Applications. Habilitation à diriger des recherches, 2010.

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, vol.12, issue.11, pp.1167-1202, 2000.
DOI : 10.1002/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-B

E. Fogel and M. Teillaud, Generic programming and the CGAL library. Effective Computational Geometry for Curves and Surfaces, pp.313-320, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01053388

C. Li, S. Pion, and C. Yap, Recent progress in exact geometric computation, The Journal of Logic and Algebraic Programming, vol.64, issue.1, pp.85-111, 2005.
DOI : 10.1016/j.jlap.2004.07.006
URL : https://hal.archives-ouvertes.fr/inria-00344355

P. Lindstrom and G. Turk, Fast and memory efficient polygonal simplification, Proceedings Visualization '98 (Cat. No.98CB36276), pp.279-286, 1998.
DOI : 10.1109/VISUAL.1998.745314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1555

L. Rineau and M. Yvinec, A generic software design for Delaunay refinement meshing, Computational Geometry, vol.38, issue.1-2, pp.100-110, 2007.
DOI : 10.1016/j.comgeo.2006.11.008
URL : https://hal.archives-ouvertes.fr/inria-00097697

P. Terdiman, OPCODE 3D Collision Detection library, 2005.

J. Tournois, C. Wormser, P. Alliez, and M. Desbrun, Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation, Proc.), pp.1-759, 2009.
DOI : 10.1145/1531326.1531381
URL : https://hal.archives-ouvertes.fr/inria-00359288

R. Wein, E. Fogel, B. Zukerman, and D. Halperin, Advanced programming techniques applied to Cgal's arrangement package, Computational Geometry, vol.38, issue.1-2, 2007.
DOI : 10.1016/j.comgeo.2006.11.007
URL : http://doi.org/10.1016/j.comgeo.2006.11.007