.
This chapters presents an overview of the two-dimensional kernel of CGAL.
The kernel consists of elementary 2D objects (such as points, lines, etc.),
predicates on these objects (such as coordinate comparison, orientation,
in-circle, etc.), and methods to compute distances and intersections between
these objects. We also provide affine transformations on these objects.
These classes are all templated by the
representation class R, which is currently either
CGAL_Cartesian<FT> or CGAL_Homogeneous<RT> for a so-called
field type FT, and ring type RT, see Chapter .