diff --git a/Generator/examples/Generator/random_convex_set.cpp b/Generator/examples/Generator/random_convex_set.cpp
index 73fbfe10b0e..61722f16525 100644
--- a/Generator/examples/Generator/random_convex_set.cpp
+++ b/Generator/examples/Generator/random_convex_set.cpp
@@ -1,11 +1,11 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_convex_set_2.h>
 
 #include <iostream>
 #include <iterator>
 
-typedef CGAL::Cartesian< double >   K;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_2                  Point_2;
 typedef CGAL::Random_points_in_square_2<
      Point_2,
diff --git a/Generator/examples/Generator/random_grid.cpp b/Generator/examples/Generator/random_grid.cpp
index d2294124508..d13cc88b628 100644
--- a/Generator/examples/Generator/random_grid.cpp
+++ b/Generator/examples/Generator/random_grid.cpp
@@ -7,8 +7,8 @@
 
 using namespace CGAL;
 
-typedef Simple_cartesian<int>         R;
-typedef R::Point_2                    Point;
+typedef Simple_cartesian<int>         K;
+typedef K::Point_2                    Point;
 typedef Creator_uniform_2<int,Point>  Creator;
 
 int main() {
diff --git a/Generator/examples/Generator/random_polygon.cpp b/Generator/examples/Generator/random_polygon.cpp
index 40b7fe46110..0788c6c971a 100644
--- a/Generator/examples/Generator/random_polygon.cpp
+++ b/Generator/examples/Generator/random_polygon.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Simple_cartesian.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_polygon_2.h>
@@ -19,7 +19,7 @@ typedef double RT;
 #include <fstream>
 #include <list>
 
-typedef CGAL::Cartesian<RT>                               K;
+typedef CGAL::Simple_cartesian<RT>                        K;
 typedef K::Point_2                                        Point_2;
 typedef std::list<Point_2>                                Container;
 typedef CGAL::Polygon_2<K, Container>                     Polygon_2;
diff --git a/Generator/examples/Generator/random_polygon2.cpp b/Generator/examples/Generator/random_polygon2.cpp
index 9b25b44bcd3..67d3c9d06e6 100644
--- a/Generator/examples/Generator/random_polygon2.cpp
+++ b/Generator/examples/Generator/random_polygon2.cpp
@@ -1,9 +1,9 @@
-#include <CGAL/Cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/point_generators_2.h>
 #include <CGAL/random_polygon_2.h>
 #include <CGAL/Polygon_2.h>
 
-typedef CGAL::Cartesian< double >                  K;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_2                                 Point_2;
 typedef std::list<Point_2>                         Container;
 typedef CGAL::Polygon_2<K, Container>              Polygon_2;
diff --git a/Generator/examples/Generator/random_segments1.cpp b/Generator/examples/Generator/random_segments1.cpp
index b6507994d25..158a9793da9 100644
--- a/Generator/examples/Generator/random_segments1.cpp
+++ b/Generator/examples/Generator/random_segments1.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <cassert>
 #include <vector>
 #include <algorithm>
@@ -11,10 +11,10 @@
 
 using namespace CGAL;
 
-typedef Simple_cartesian<double>         R;
-typedef R::Point_2                       Point;
+typedef Exact_predicates_inexact_constructions_kernel K;
+typedef K::Point_2                       Point;
 typedef Creator_uniform_2<double,Point>  Pt_creator;
-typedef R::Segment_2                     Segment;
+typedef K::Segment_2                     Segment;
 typedef std::vector<Segment>             Vector;
 
 
diff --git a/Generator/examples/Generator/random_segments2.cpp b/Generator/examples/Generator/random_segments2.cpp
index 5d9f9bfb752..3c7322e2432 100644
--- a/Generator/examples/Generator/random_segments2.cpp
+++ b/Generator/examples/Generator/random_segments2.cpp
@@ -1,7 +1,7 @@
 // CGAL example program for the generic segment generator
 // using precomputed point locations.
 
-#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <algorithm>
 #include <vector>
 #include <CGAL/point_generators_2.h>
@@ -11,9 +11,9 @@
 
 using namespace CGAL;
 
-typedef Simple_cartesian<double>                  R;
-typedef R::Point_2                                Point;
-typedef R::Segment_2                              Segment;
+typedef Exact_predicates_inexact_constructions_kernel K;
+typedef K::Point_2                                Point;
+typedef K::Segment_2                              Segment;
 typedef Points_on_segment_2<Point>                PG;
 typedef Creator_uniform_2< Point, Segment>        Creator;
 typedef Join_input_iterator_2< PG, PG, Creator>   Segm_iterator;