The concept of a kernel is defined by a set of requirements on the provision of certain types and access member functions to create objects of these types. The types are function object classes to be used within the algorithms and data structures in the basic library of CGAL. This allows you to use any model of a kernel as a traits class in the CGAL algorithms and data structures, unless they require types beyond those provided by a kernel. More...
The concept of a kernel with lifting is a small refinement of the general kernel concept. It adds 2 functors, the meaning of which would be unclear in kernels of fixed dimension. More...