The main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library CGAL (Computational Geometry Algorithms Library) are presented. These choices have been mainly guided by the general goals of CGAL triangulation package, which are robustness, efficiency, ease of use of flexibility. Called specifications, the different kinds of triangulations implemented in CGAL and the main functionalities offered by these triangulations are described.