diff --git a/Triangulation/test/Triangulation/delaunay.cpp b/Triangulation/test/Triangulation/delaunay.cpp
index 3a0dad37f07..13ab4f97cc8 100644
--- a/Triangulation/test/Triangulation/delaunay.cpp
+++ b/Triangulation/test/Triangulation/delaunay.cpp
@@ -1,5 +1,4 @@
 #include <CGAL/Epick_d.h>
-#include <CGAL/io/Triangulation_io.h>
 #include <CGAL/point_generators_d.h>
 #include <CGAL/Delaunay_triangulation.h>
 #include <CGAL/spatial_sort.h>
@@ -94,8 +93,6 @@ void test(const int d, const string & type, const int N)
         cout << "\nThere are " << cells.size() << " vertices on the convex hull.";
         cells.clear();
     }
-    
-    cout << dt.tds() << std::endl;
 
     // Remove all !
     cerr << "\nBefore removal: " << dt.number_of_vertices() << " vertices. After: ";
diff --git a/Triangulation/test/Triangulation/regular.cpp b/Triangulation/test/Triangulation/regular.cpp
index 1956651c682..8b6198dad8e 100644
--- a/Triangulation/test/Triangulation/regular.cpp
+++ b/Triangulation/test/Triangulation/regular.cpp
@@ -1,5 +1,4 @@
 #include <CGAL/Epick_d.h>
-#include <CGAL/io/Triangulation_io.h>
 #include <CGAL/point_generators_d.h>
 #include <CGAL/Regular_triangulation.h>
 #include <CGAL/Regular_triangulation_euclidean_traits.h>
@@ -46,7 +45,7 @@ void test(const int d, const string & type, const int N)
       coords[j] = static_cast<double>(rand() % 100000)/10000;
     points.push_back(Point(
       Bare_point(d, coords.begin(), coords.end()), 
-      static_cast<double>(rand() % 100000)/100000
+      /*static_cast<double>(rand() % 100000)/100000*/static_cast<double>(i)/20
     ));
   }
   rt.insert(points.begin(),  points.end());
@@ -94,8 +93,6 @@ void test(const int d, const string & type, const int N)
     cells.clear();
   }
 
-  cout << rt.tds() << std::endl;
-
   // Remove all !
   cerr << "\nBefore removal: " << rt.number_of_vertices() << " vertices. After: ";
   random_shuffle(points.begin(),  points.end());